%------------------------------------------------------------------------------
% File : JavaRes---1.3.0
% Problem : LCL451+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 : n027.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:24 PM UTC 2025
% Result : Theorem 2.70s 1.04s
% Output : CNFRefutation 2.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : LCL451+1 : TPTP v9.2.0. Bugfixed v9.2.0.
% 0.08/0.12 % 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.12/0.33 % Computer : n027.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Sep 30 13:17:38 EDT 2025
% 0.12/0.33 % CPUTime :
% 0.19/0.46 # Using default include path : /export/starexec/sandbox2/benchmark
% 0.19/0.47 # INFO in ProverFOF.main(): Processing file /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47 # ProverFOF.processTestFile(): filename: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47 # 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.47 # ProverFOF.processTestFile(): evals: [Heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval] litSelect: LARGEST indexing: true delTaut: true forSub: true backSub: true]
% 0.19/0.48 # INFO in Formula.command2clauses(): include file: /export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax
% 0.19/0.61 # INFO in Formula.command2clauses(): include file: /export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax
% 0.89/0.61 # INFO in Formula.command2clauses(): include file: /export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax
% 0.89/0.62 # hasConjecture: true isFOF: true
% 0.89/0.62 # ProverFOF() problem is equational
% 0.89/0.62 # INFO in ClauseSet.addEqAxioms(): adding axioms
% 0.89/0.62 # ProofState(): heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.98/0.62 # HeuristicsClauseSet using eval functions: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 2.70/1.04 # -----------------
% 2.70/1.04 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.70/1.04
% 2.70/1.04 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.70/1.04 fof(luka_cn1,conjecture,cn1,input).
% 2.70/1.04 fof(f307,negated_conjecture,(~cn1),inference(assume_negation, status(cth), [luka_cn1])).
% 2.70/1.04 fof(f310,negated_conjecture,~cn1,inference(fof_simplification, status(thm), [f307])).
% 2.70/1.04 cnf(cnf81,negated_conjecture,~cn1,inference(split_conjunct, status(thm), [f310])).
% 2.70/1.04 fof(cn1,axiom,(cn1<=>(![P]:(![Q]:(![R]:is_a_theorem(implies(implies(P,Q),implies(implies(Q,R),implies(P,R)))))))),input).
% 2.70/1.04 fof(f146,axiom,(cn1<=>(![P]:(![Q]:(![R]:is_a_theorem(implies(implies(P,Q),implies(implies(Q,R),implies(P,R)))))))),inference(fof_simplification, status(thm), [cn1])).
% 2.70/1.04 fof(f147,axiom,((~cn1|(![P]:(![Q]:(![R]:is_a_theorem(implies(implies(P,Q),implies(implies(Q,R),implies(P,R))))))))&((?[P]:(?[Q]:(?[R]:~is_a_theorem(implies(implies(P,Q),implies(implies(Q,R),implies(P,R)))))))|cn1)),inference(fof_nnf, status(thm), [f146])).
% 2.70/1.04 fof(f148,axiom,((~cn1|(![VAR116]:(![VAR115]:(![VAR114]:is_a_theorem(implies(implies(VAR116,VAR115),implies(implies(VAR115,VAR114),implies(VAR116,VAR114))))))))&((?[VAR119]:(?[VAR118]:(?[VAR117]:~is_a_theorem(implies(implies(VAR119,VAR118),implies(implies(VAR118,VAR117),implies(VAR119,VAR117)))))))|cn1)),inference(variable_rename, status(thm), [f147])).
% 2.70/1.04 fof(f149,axiom,((~cn1|(![VAR116]:(![VAR115]:(![VAR114]:is_a_theorem(implies(implies(VAR116,VAR115),implies(implies(VAR115,VAR114),implies(VAR116,VAR114))))))))&(~is_a_theorem(implies(implies(skf120,skf121),implies(implies(skf121,skf122),implies(skf120,skf122))))|cn1)),inference(skolemize, status(esa), [f148])).
% 2.70/1.04 fof(f150,axiom,((~cn1|is_a_theorem(implies(implies(VAR116,VAR115),implies(implies(VAR115,VAR114),implies(VAR116,VAR114)))))&(~is_a_theorem(implies(implies(skf120,skf121),implies(implies(skf121,skf122),implies(skf120,skf122))))|cn1)),inference(shift_quantors, status(thm), [f149])).
% 2.70/1.04 fof(f151,axiom,((~cn1|is_a_theorem(implies(implies(VAR116,VAR115),implies(implies(VAR115,VAR114),implies(VAR116,VAR114)))))&(~is_a_theorem(implies(implies(skf120,skf121),implies(implies(skf121,skf122),implies(skf120,skf122))))|cn1)),inference(distribute, status(thm), [f150])).
% 2.70/1.04 cnf(cnf40,axiom,~is_a_theorem(implies(implies(skf120,skf121),implies(implies(skf121,skf122),implies(skf120,skf122))))|cn1,inference(split_conjunct, status(thm), [f151])).
% 2.70/1.04 fof(hilbert_implies_3,axiom,implies_3,input).
% 2.70/1.04 fof(f266,axiom,implies_3,inference(fof_simplification, status(thm), [hilbert_implies_3])).
% 2.70/1.04 cnf(cnf67,axiom,implies_3,inference(split_conjunct, status(thm), [f266])).
% 2.70/1.04 fof(implies_3,axiom,(implies_3<=>(![X]:(![Y]:(![Z]:is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))))))),input).
% 2.70/1.04 fof(f42,axiom,(implies_3<=>(![X]:(![Y]:(![Z]:is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))))))),inference(fof_simplification, status(thm), [implies_3])).
% 2.70/1.04 fof(f43,axiom,((~implies_3|(![X]:(![Y]:(![Z]:is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z))))))))&((?[X]:(?[Y]:(?[Z]:~is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))))))|implies_3)),inference(fof_nnf, status(thm), [f42])).
% 2.70/1.04 fof(f44,axiom,((~implies_3|(![VAR32]:(![VAR31]:(![VAR30]:is_a_theorem(implies(implies(VAR32,VAR31),implies(implies(VAR31,VAR30),implies(VAR32,VAR30))))))))&((?[VAR35]:(?[VAR34]:(?[VAR33]:~is_a_theorem(implies(implies(VAR35,VAR34),implies(implies(VAR34,VAR33),implies(VAR35,VAR33)))))))|implies_3)),inference(variable_rename, status(thm), [f43])).
% 2.70/1.04 fof(f45,axiom,((~implies_3|(![VAR32]:(![VAR31]:(![VAR30]:is_a_theorem(implies(implies(VAR32,VAR31),implies(implies(VAR31,VAR30),implies(VAR32,VAR30))))))))&(~is_a_theorem(implies(implies(skf36,skf37),implies(implies(skf37,skf38),implies(skf36,skf38))))|implies_3)),inference(skolemize, status(esa), [f44])).
% 2.70/1.04 fof(f46,axiom,((~implies_3|is_a_theorem(implies(implies(VAR32,VAR31),implies(implies(VAR31,VAR30),implies(VAR32,VAR30)))))&(~is_a_theorem(implies(implies(skf36,skf37),implies(implies(skf37,skf38),implies(skf36,skf38))))|implies_3)),inference(shift_quantors, status(thm), [f45])).
% 2.70/1.04 fof(f47,axiom,((~implies_3|is_a_theorem(implies(implies(VAR32,VAR31),implies(implies(VAR31,VAR30),implies(VAR32,VAR30)))))&(~is_a_theorem(implies(implies(skf36,skf37),implies(implies(skf37,skf38),implies(skf36,skf38))))|implies_3)),inference(distribute, status(thm), [f46])).
% 2.70/1.04 cnf(cnf13,axiom,~implies_3|is_a_theorem(implies(implies(X64,X65),implies(implies(X65,X66),implies(X64,X66)))),inference(split_conjunct, status(thm), [f47])).
% 2.70/1.04 cnf(c32,plain,is_a_theorem(implies(implies(X388,X389),implies(implies(X389,X390),implies(X388,X390)))),inference(resolution, status(thm), [cnf13, cnf67])).
% 2.70/1.05 cnf(c377,plain,cn1,inference(resolution, status(thm), [c32, cnf40])).
% 2.70/1.05 cnf(c382,plain,$false,inference(resolution, status(thm), [c377, cnf81])).
% 2.70/1.05 % SZS output end CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.70/1.05 # Filename : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.70/1.05 # Indexed : true
% 2.70/1.05 # Eval function name : PickGiven5
% 2.70/1.05 # Initial clauses : 91
% 2.70/1.05 # Processed clauses : 160
% 2.70/1.05 # Factors computed : 5
% 2.70/1.05 # Resolvents computed: 378
% 2.70/1.05 # Tautologies deleted: 3
% 2.70/1.05 # Forward subsumed : 54
% 2.70/1.05 # Backward subsumed : 37
% 2.70/1.05 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.70/1.05 # SZS Expected : Theorem
% 2.70/1.05 # time : 414ms
% 2.70/1.05
%------------------------------------------------------------------------------