%------------------------------------------------------------------------------
% File : JavaRes---1.3.0
% Problem : LCL506+1 : TPTP v9.2.0. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xmx15G -cp /export/starexec/sandbox2/solver/bin atp.ProverFOF -i /export/starexec/sandbox2/benchmark --eqax --proof --forward-subsumption --backward_subsumption --delete-tautologies --timeout 0 %s
% Computer : n028.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Oct 1 12:40:28 PM UTC 2025
% Result : Theorem 1.08s 0.66s
% Output : CNFRefutation 1.08s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL506+1 : TPTP v9.2.0. Bugfixed v9.2.0.
% 0.03/0.13 % Command : java -Xmx15G -cp /export/starexec/sandbox2/solver/bin atp.ProverFOF -i /export/starexec/sandbox2/benchmark --eqax --proof --forward-subsumption --backward_subsumption --delete-tautologies --timeout 0 %s
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Sep 30 13:26:38 EDT 2025
% 0.13/0.34 % CPUTime :
% 0.19/0.47 # Using default include path : /export/starexec/sandbox2/benchmark
% 0.19/0.48 # INFO in ProverFOF.main(): Processing file /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.48 # ProverFOF.processTestFile(): filename: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.48 # ProverFOF.processTestFile(): opts: {backward_subsumption=true, delete-tautologies=true, filename=/export/starexec/sandbox2/benchmark/theBenchmark.p, forward-subsumption=true, proof=true, eqax=true, timeout=0}
% 0.19/0.48 # ProverFOF.processTestFile(): evals: [Heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval] litSelect: LARGEST indexing: true delTaut: true forSub: true backSub: true]
% 0.19/0.49 # INFO in Formula.command2clauses(): include file: /export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax
% 0.70/0.61 # INFO in Formula.command2clauses(): include file: /export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax
% 0.70/0.62 # INFO in Formula.command2clauses(): include file: /export/starexec/sandbox2/benchmark/Axioms/LCL006+5.ax
% 0.70/0.62 # hasConjecture: true isFOF: true
% 0.70/0.62 # ProverFOF() problem is equational
% 0.70/0.62 # INFO in ClauseSet.addEqAxioms(): adding axioms
% 0.70/0.63 # ProofState(): heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.70/0.63 # HeuristicsClauseSet using eval functions: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 1.08/0.66 # -----------------
% 1.08/0.66 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.08/0.66
% 1.08/0.66 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.08/0.66 fof(hilbert_and_1,conjecture,and_1,input).
% 1.08/0.66 fof(f277,negated_conjecture,(~and_1),inference(assume_negation, status(cth), [hilbert_and_1])).
% 1.08/0.66 fof(f280,negated_conjecture,~and_1,inference(fof_simplification, status(thm), [f277])).
% 1.08/0.66 cnf(cnf71,negated_conjecture,~and_1,inference(split_conjunct, status(thm), [f280])).
% 1.08/0.66 fof(rosser_kn2,axiom,kn2,input).
% 1.08/0.66 fof(f260,axiom,kn2,inference(fof_simplification, status(thm), [rosser_kn2])).
% 1.08/0.66 cnf(cnf65,axiom,kn2,inference(split_conjunct, status(thm), [f260])).
% 1.08/0.66 fof(kn2,axiom,(kn2<=>(![P]:(![Q]:is_a_theorem(implies(and(P,Q),P))))),input).
% 1.08/0.66 fof(f130,axiom,(kn2<=>(![P]:(![Q]:is_a_theorem(implies(and(P,Q),P))))),inference(fof_simplification, status(thm), [kn2])).
% 1.08/0.66 fof(f131,axiom,((~kn2|(![P]:(![Q]:is_a_theorem(implies(and(P,Q),P)))))&((?[P]:(?[Q]:~is_a_theorem(implies(and(P,Q),P))))|kn2)),inference(fof_nnf, status(thm), [f130])).
% 1.08/0.66 fof(f132,axiom,((~kn2|(![VAR100]:(![VAR99]:is_a_theorem(implies(and(VAR100,VAR99),VAR100)))))&((?[VAR102]:(?[VAR101]:~is_a_theorem(implies(and(VAR102,VAR101),VAR102))))|kn2)),inference(variable_rename, status(thm), [f131])).
% 1.08/0.66 fof(f133,axiom,((~kn2|(![VAR100]:(![VAR99]:is_a_theorem(implies(and(VAR100,VAR99),VAR100)))))&(~is_a_theorem(implies(and(skf103,skf104),skf103))|kn2)),inference(skolemize, status(esa), [f132])).
% 1.08/0.66 fof(f134,axiom,((~kn2|is_a_theorem(implies(and(VAR100,VAR99),VAR100)))&(~is_a_theorem(implies(and(skf103,skf104),skf103))|kn2)),inference(shift_quantors, status(thm), [f133])).
% 1.08/0.66 fof(f135,axiom,((~kn2|is_a_theorem(implies(and(VAR100,VAR99),VAR100)))&(~is_a_theorem(implies(and(skf103,skf104),skf103))|kn2)),inference(distribute, status(thm), [f134])).
% 1.08/0.66 cnf(cnf35,axiom,~kn2|is_a_theorem(implies(and(X26,X27),X26)),inference(split_conjunct, status(thm), [f135])).
% 1.08/0.66 cnf(c4,plain,is_a_theorem(implies(and(X28,X29),X28)),inference(resolution, status(thm), [cnf35, cnf65])).
% 1.08/0.66 fof(and_1,axiom,(and_1<=>(![X]:(![Y]:is_a_theorem(implies(and(X,Y),X))))),input).
% 1.08/0.66 fof(f50,axiom,(and_1<=>(![X]:(![Y]:is_a_theorem(implies(and(X,Y),X))))),inference(fof_simplification, status(thm), [and_1])).
% 1.08/0.66 fof(f51,axiom,((~and_1|(![X]:(![Y]:is_a_theorem(implies(and(X,Y),X)))))&((?[X]:(?[Y]:~is_a_theorem(implies(and(X,Y),X))))|and_1)),inference(fof_nnf, status(thm), [f50])).
% 1.08/0.66 fof(f52,axiom,((~and_1|(![VAR40]:(![VAR39]:is_a_theorem(implies(and(VAR40,VAR39),VAR40)))))&((?[VAR42]:(?[VAR41]:~is_a_theorem(implies(and(VAR42,VAR41),VAR42))))|and_1)),inference(variable_rename, status(thm), [f51])).
% 1.08/0.66 fof(f53,axiom,((~and_1|(![VAR40]:(![VAR39]:is_a_theorem(implies(and(VAR40,VAR39),VAR40)))))&(~is_a_theorem(implies(and(skf43,skf44),skf43))|and_1)),inference(skolemize, status(esa), [f52])).
% 1.08/0.66 fof(f54,axiom,((~and_1|is_a_theorem(implies(and(VAR40,VAR39),VAR40)))&(~is_a_theorem(implies(and(skf43,skf44),skf43))|and_1)),inference(shift_quantors, status(thm), [f53])).
% 1.08/0.66 fof(f55,axiom,((~and_1|is_a_theorem(implies(and(VAR40,VAR39),VAR40)))&(~is_a_theorem(implies(and(skf43,skf44),skf43))|and_1)),inference(distribute, status(thm), [f54])).
% 1.08/0.66 cnf(cnf16,axiom,~is_a_theorem(implies(and(skf43,skf44),skf43))|and_1,inference(split_conjunct, status(thm), [f55])).
% 1.08/0.66 cnf(c11,plain,and_1,inference(resolution, status(thm), [cnf16, c4])).
% 1.08/0.66 cnf(c12,plain,$false,inference(resolution, status(thm), [c11, cnf71])).
% 1.08/0.66 % SZS output end CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.08/0.66 # Filename : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.08/0.66 # Indexed : true
% 1.08/0.66 # Eval function name : PickGiven5
% 1.08/0.66 # Initial clauses : 81
% 1.08/0.66 # Processed clauses : 36
% 1.08/0.66 # Factors computed : 1
% 1.08/0.66 # Resolvents computed: 12
% 1.08/0.66 # Tautologies deleted: 3
% 1.08/0.66 # Forward subsumed : 11
% 1.08/0.66 # Backward subsumed : 3
% 1.08/0.66 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.08/0.66 # SZS Expected : Theorem
% 1.08/0.66 # time : 22ms
% 1.08/0.66
%------------------------------------------------------------------------------