%------------------------------------------------------------------------------
% File : JavaRes---1.3.0
% Problem : LCL491+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 : n008.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:27 PM UTC 2025
% Result : Theorem 0.91s 0.68s
% Output : CNFRefutation 0.91s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : LCL491+1 : TPTP v9.2.0. Bugfixed v9.2.0.
% 0.11/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.35 % Computer : n008.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Sep 30 12:41:08 EDT 2025
% 0.13/0.35 % CPUTime :
% 0.19/0.48 # Using default include path : /export/starexec/sandbox2/benchmark
% 0.19/0.49 # INFO in ProverFOF.main(): Processing file /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.49 # ProverFOF.processTestFile(): filename: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.49 # 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.49 # ProverFOF.processTestFile(): evals: [Heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval] litSelect: LARGEST indexing: true delTaut: true forSub: true backSub: true]
% 0.19/0.51 # INFO in Formula.command2clauses(): include file: /export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax
% 0.74/0.62 # INFO in Formula.command2clauses(): include file: /export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax
% 0.74/0.63 # INFO in Formula.command2clauses(): include file: /export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax
% 0.91/0.64 # hasConjecture: true isFOF: true
% 0.91/0.64 # ProverFOF() problem is equational
% 0.91/0.64 # INFO in ClauseSet.addEqAxioms(): adding axioms
% 0.91/0.64 # ProofState(): heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.91/0.64 # HeuristicsClauseSet using eval functions: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.91/0.68 # -----------------
% 0.91/0.68 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.91/0.68
% 0.91/0.68 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.91/0.68 fof(hilbert_or_2,conjecture,or_2,input).
% 0.91/0.68 fof(f283,negated_conjecture,(~or_2),inference(assume_negation, status(cth), [hilbert_or_2])).
% 0.91/0.68 fof(f286,negated_conjecture,~or_2,inference(fof_simplification, status(thm), [f283])).
% 0.91/0.68 cnf(cnf73,negated_conjecture,~or_2,inference(split_conjunct, status(thm), [f286])).
% 0.91/0.68 fof(principia_r2,axiom,r2,input).
% 0.91/0.68 fof(f260,axiom,r2,inference(fof_simplification, status(thm), [principia_r2])).
% 0.91/0.68 cnf(cnf65,axiom,r2,inference(split_conjunct, status(thm), [f260])).
% 0.91/0.68 fof(r2,axiom,(r2<=>(![P]:(![Q]:is_a_theorem(implies(Q,or(P,Q)))))),input).
% 0.91/0.68 fof(f178,axiom,(r2<=>(![P]:(![Q]:is_a_theorem(implies(Q,or(P,Q)))))),inference(fof_simplification, status(thm), [r2])).
% 0.91/0.68 fof(f179,axiom,((~r2|(![P]:(![Q]:is_a_theorem(implies(Q,or(P,Q))))))&((?[P]:(?[Q]:~is_a_theorem(implies(Q,or(P,Q)))))|r2)),inference(fof_nnf, status(thm), [f178])).
% 0.91/0.68 fof(f180,axiom,((~r2|(![VAR136]:(![VAR135]:is_a_theorem(implies(VAR135,or(VAR136,VAR135))))))&((?[VAR138]:(?[VAR137]:~is_a_theorem(implies(VAR137,or(VAR138,VAR137)))))|r2)),inference(variable_rename, status(thm), [f179])).
% 0.91/0.68 fof(f181,axiom,((~r2|(![VAR136]:(![VAR135]:is_a_theorem(implies(VAR135,or(VAR136,VAR135))))))&(~is_a_theorem(implies(skf140,or(skf139,skf140)))|r2)),inference(skolemize, status(esa), [f180])).
% 0.91/0.68 fof(f182,axiom,((~r2|is_a_theorem(implies(VAR135,or(VAR136,VAR135))))&(~is_a_theorem(implies(skf140,or(skf139,skf140)))|r2)),inference(shift_quantors, status(thm), [f181])).
% 0.91/0.68 fof(f183,axiom,((~r2|is_a_theorem(implies(VAR135,or(VAR136,VAR135))))&(~is_a_theorem(implies(skf140,or(skf139,skf140)))|r2)),inference(distribute, status(thm), [f182])).
% 0.91/0.68 cnf(cnf47,axiom,~r2|is_a_theorem(implies(X29,or(X30,X29))),inference(split_conjunct, status(thm), [f183])).
% 0.91/0.68 cnf(c4,plain,is_a_theorem(implies(X31,or(X32,X31))),inference(resolution, status(thm), [cnf47, cnf65])).
% 0.91/0.68 fof(or_2,axiom,(or_2<=>(![X]:(![Y]:is_a_theorem(implies(Y,or(X,Y)))))),input).
% 0.91/0.68 fof(f82,axiom,(or_2<=>(![X]:(![Y]:is_a_theorem(implies(Y,or(X,Y)))))),inference(fof_simplification, status(thm), [or_2])).
% 0.91/0.68 fof(f83,axiom,((~or_2|(![X]:(![Y]:is_a_theorem(implies(Y,or(X,Y))))))&((?[X]:(?[Y]:~is_a_theorem(implies(Y,or(X,Y)))))|or_2)),inference(fof_nnf, status(thm), [f82])).
% 0.91/0.68 fof(f84,axiom,((~or_2|(![VAR64]:(![VAR63]:is_a_theorem(implies(VAR63,or(VAR64,VAR63))))))&((?[VAR66]:(?[VAR65]:~is_a_theorem(implies(VAR65,or(VAR66,VAR65)))))|or_2)),inference(variable_rename, status(thm), [f83])).
% 0.91/0.68 fof(f85,axiom,((~or_2|(![VAR64]:(![VAR63]:is_a_theorem(implies(VAR63,or(VAR64,VAR63))))))&(~is_a_theorem(implies(skf68,or(skf67,skf68)))|or_2)),inference(skolemize, status(esa), [f84])).
% 0.91/0.68 fof(f86,axiom,((~or_2|is_a_theorem(implies(VAR63,or(VAR64,VAR63))))&(~is_a_theorem(implies(skf68,or(skf67,skf68)))|or_2)),inference(shift_quantors, status(thm), [f85])).
% 0.91/0.68 fof(f87,axiom,((~or_2|is_a_theorem(implies(VAR63,or(VAR64,VAR63))))&(~is_a_theorem(implies(skf68,or(skf67,skf68)))|or_2)),inference(distribute, status(thm), [f86])).
% 0.91/0.68 cnf(cnf24,axiom,~is_a_theorem(implies(skf68,or(skf67,skf68)))|or_2,inference(split_conjunct, status(thm), [f87])).
% 0.91/0.68 cnf(c11,plain,or_2,inference(resolution, status(thm), [cnf24, c4])).
% 0.91/0.68 cnf(c12,plain,$false,inference(resolution, status(thm), [c11, cnf73])).
% 0.91/0.68 % SZS output end CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.91/0.68 # Filename : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.91/0.68 # Indexed : true
% 0.91/0.68 # Eval function name : PickGiven5
% 0.91/0.68 # Initial clauses : 83
% 0.91/0.68 # Processed clauses : 45
% 0.91/0.68 # Factors computed : 1
% 0.91/0.68 # Resolvents computed: 12
% 0.91/0.68 # Tautologies deleted: 3
% 0.91/0.68 # Forward subsumed : 9
% 0.91/0.68 # Backward subsumed : 3
% 0.91/0.68 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.91/0.68 # SZS Expected : Theorem
% 0.91/0.68 # time : 28ms
% 0.91/0.68
%------------------------------------------------------------------------------