%------------------------------------------------------------------------------
% File : JavaRes---1.3.0
% Problem : SYN973+1 : TPTP v7.5.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xmx15G -cp /export/starexec/sandbox/solver/bin atp.ProverFOF -i /export/starexec/sandbox/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 : 600s
% DateTime : Mon Mar 28 18:31:57 EDT 2022
% Result : Theorem 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named input)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
( p(z)
=> p(z) ),
input ).
fof(f1,negated_conjecture,
~ ( p(z)
=> p(z) ),
inference(assume_negation,status(cth),[prove_this]) ).
fof(f4,negated_conjecture,
~ ( p(z)
=> p(z) ),
inference(fof_simplification,status(thm),[f1]) ).
fof(f5,negated_conjecture,
( p(z)
& ~ p(z) ),
inference(fof_nnf,status(thm),[f4]) ).
cnf(cnf0,negated_conjecture,
p(z),
inference(split_conjunct,status(thm),[f5]) ).
fof(prove_this_001,conjecture,
( p(z)
=> p(z) ),
input ).
fof(f1_002,negated_conjecture,
~ ( p(z)
=> p(z) ),
inference(assume_negation,status(cth),[prove_this]) ).
fof(f4_003,negated_conjecture,
~ ( p(z)
=> p(z) ),
inference(fof_simplification,status(thm),[f1]) ).
fof(f5_004,negated_conjecture,
( p(z)
& ~ p(z) ),
inference(fof_nnf,status(thm),[f4]) ).
cnf(cnf1,negated_conjecture,
~ p(z),
inference(split_conjunct,status(thm),[f5]) ).
cnf(c0,plain,
$false,
inference(resolution,status(thm),[cnf1,cnf0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN973+1 : TPTP v7.5.0. Released v3.1.0.
% 0.07/0.13 % Command : java -Xmx15G -cp /export/starexec/sandbox/solver/bin atp.ProverFOF -i /export/starexec/sandbox/benchmark --eqax --proof --forward-subsumption --backward_subsumption --delete-tautologies --timeout 0 %s
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % RAMPerCPU : 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 : 600
% 0.13/0.34 % DateTime : Thu Mar 10 18:48:47 EST 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.47 # Using default include path : /export/starexec/sandbox/benchmark
% 0.20/0.47 # INFO in ProverFOF.main(): Processing file /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 # ProverFOF.processTestFile(): filename: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 # ProverFOF.processTestFile(): opts: {backward_subsumption=true, delete-tautologies=true, filename=/export/starexec/sandbox/benchmark/theBenchmark.p, forward-subsumption=true, proof=true, eqax=true, timeout=0}
% 0.20/0.47 # ProverFOF.processTestFile(): evals: [Heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval] litSelect: LARGEST indexing: true delTaut: true forSub: true backSub: true]
% 0.20/0.50 # hasConjecture: true isFOF: true
% 0.20/0.50 # ProofState(): heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.20/0.50 # HeuristicsClauseSet using eval functions: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.20/0.51 # -----------------
% 0.20/0.51 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.51
% 0.20/0.51 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.51 fof(prove_this,conjecture,(p(z)=>p(z)),input).
% 0.20/0.51 fof(f1,negated_conjecture,(~(p(z)=>p(z))),inference(assume_negation, status(cth), [prove_this])).
% 0.20/0.51 fof(f4,negated_conjecture,(~(p(z)=>p(z))),inference(fof_simplification, status(thm), [f1])).
% 0.20/0.51 fof(f5,negated_conjecture,(p(z)&~p(z)),inference(fof_nnf, status(thm), [f4])).
% 0.20/0.51 cnf(cnf0,negated_conjecture,p(z),inference(split_conjunct, status(thm), [f5])).
% 0.20/0.51 fof(prove_this,conjecture,(p(z)=>p(z)),input).
% 0.20/0.51 fof(f1,negated_conjecture,(~(p(z)=>p(z))),inference(assume_negation, status(cth), [prove_this])).
% 0.20/0.51 fof(f4,negated_conjecture,(~(p(z)=>p(z))),inference(fof_simplification, status(thm), [f1])).
% 0.20/0.51 fof(f5,negated_conjecture,(p(z)&~p(z)),inference(fof_nnf, status(thm), [f4])).
% 0.20/0.51 cnf(cnf1,negated_conjecture,~p(z),inference(split_conjunct, status(thm), [f5])).
% 0.20/0.51 cnf(c0,plain,$false,inference(resolution, status(thm), [cnf1, cnf0])).
% 0.20/0.51 % SZS output end CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.51 # Filename : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.51 # Indexed : true
% 0.20/0.51 # Eval function name : PickGiven5
% 0.20/0.51 # Initial clauses : 2
% 0.20/0.51 # Processed clauses : 2
% 0.20/0.51 # Factors computed : 0
% 0.20/0.51 # Resolvents computed: 1
% 0.20/0.51 # Tautologies deleted: 0
% 0.20/0.51 # Forward subsumed : 0
% 0.20/0.51 # Backward subsumed : 0
% 0.20/0.51 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.51 # SZS Expected : Theorem
% 0.20/0.51 # time : 6ms
% 0.20/0.51
%------------------------------------------------------------------------------