TSTP Solution File: SYN986+1.001 by JavaRes---1.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : JavaRes---1.3.0
% Problem : SYN986+1.001 : TPTP v7.5.0. Released v4.0.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 : n010.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:59 EDT 2022
% Result : Theorem 0.46s 0.53s
% Output : CNFRefutation 0.52s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN986+1.001 : TPTP v7.5.0. Released v4.0.0.
% 0.07/0.12 % 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.12/0.33 % Computer : n010.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % RAMPerCPU : 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 : 600
% 0.12/0.33 % DateTime : Thu Mar 10 19:42:22 EST 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.46 # Using default include path : /export/starexec/sandbox/benchmark
% 0.19/0.47 # INFO in ProverFOF.main(): Processing file /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47 # ProverFOF.processTestFile(): filename: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/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.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/sandbox/benchmark/Axioms/SYN002+0.ax
% 0.19/0.51 # hasConjecture: true isFOF: true
% 0.19/0.51 # ProofState(): heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.19/0.51 # HeuristicsClauseSet using eval functions: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.46/0.53 # -----------------
% 0.46/0.53 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.46/0.53
% 0.46/0.53 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.46/0.53 fof(hyp1,axiom,(![Y]:r(Y,zero,succ(Y))),input).
% 0.46/0.53 fof(f2,axiom,(![Y]:r(Y,zero,succ(Y))),inference(fof_simplification, status(thm), [hyp1])).
% 0.46/0.53 fof(f3,axiom,(![VAR0]:r(VAR0,zero,succ(VAR0))),inference(variable_rename, status(thm), [f2])).
% 0.46/0.53 fof(f4,axiom,r(VAR0,zero,succ(VAR0)),inference(shift_quantors, status(thm), [f3])).
% 0.46/0.53 cnf(cnf0,axiom,r(X1,zero,succ(X1)),inference(split_conjunct, status(thm), [f4])).
% 0.46/0.53 fof(ck,conjecture,(?[Z1]:(?[Z0]:(r(zero,zero,Z1)&r(zero,Z1,Z0)))),input).
% 0.46/0.53 fof(f12,negated_conjecture,(~(?[Z1]:(?[Z0]:(r(zero,zero,Z1)&r(zero,Z1,Z0))))),inference(assume_negation, status(cth), [ck])).
% 0.46/0.53 fof(f15,negated_conjecture,(~(?[Z1]:(?[Z0]:(r(zero,zero,Z1)&r(zero,Z1,Z0))))),inference(fof_simplification, status(thm), [f12])).
% 0.46/0.53 fof(f16,negated_conjecture,(![Z1]:(![Z0]:(~r(zero,zero,Z1)|~r(zero,Z1,Z0)))),inference(fof_nnf, status(thm), [f15])).
% 0.46/0.53 fof(f17,negated_conjecture,(![VAR6]:(![VAR5]:(~r(zero,zero,VAR6)|~r(zero,VAR6,VAR5)))),inference(variable_rename, status(thm), [f16])).
% 0.46/0.53 fof(f18,negated_conjecture,(~r(zero,zero,VAR6)|~r(zero,VAR6,VAR5)),inference(shift_quantors, status(thm), [f17])).
% 0.46/0.53 cnf(cnf2,negated_conjecture,~r(zero,zero,X2)|~r(zero,X2,X3),inference(split_conjunct, status(thm), [f18])).
% 0.46/0.53 fof(hyp1,axiom,(![Y]:r(Y,zero,succ(Y))),input).
% 0.46/0.53 fof(f2,axiom,(![Y]:r(Y,zero,succ(Y))),inference(fof_simplification, status(thm), [hyp1])).
% 0.46/0.53 fof(f3,axiom,(![VAR0]:r(VAR0,zero,succ(VAR0))),inference(variable_rename, status(thm), [f2])).
% 0.46/0.53 fof(f4,axiom,r(VAR0,zero,succ(VAR0)),inference(shift_quantors, status(thm), [f3])).
% 0.46/0.53 cnf(cnf0,axiom,r(X1,zero,succ(X1)),inference(split_conjunct, status(thm), [f4])).
% 0.46/0.53 fof(hyp1,axiom,(![Y]:r(Y,zero,succ(Y))),input).
% 0.46/0.53 fof(f2,axiom,(![Y]:r(Y,zero,succ(Y))),inference(fof_simplification, status(thm), [hyp1])).
% 0.46/0.53 fof(f3,axiom,(![VAR0]:r(VAR0,zero,succ(VAR0))),inference(variable_rename, status(thm), [f2])).
% 0.46/0.53 fof(f4,axiom,r(VAR0,zero,succ(VAR0)),inference(shift_quantors, status(thm), [f3])).
% 0.46/0.53 cnf(cnf0,axiom,r(X1,zero,succ(X1)),inference(split_conjunct, status(thm), [f4])).
% 0.46/0.53 fof(hyp2,axiom,(![Y]:(![X]:(![Z]:(![Z1]:(r(Y,X,Z)=>(r(Z,X,Z1)=>r(Y,succ(X),Z1))))))),input).
% 0.52/0.53 fof(f7,axiom,(![Y]:(![X]:(![Z]:(![Z1]:(r(Y,X,Z)=>(r(Z,X,Z1)=>r(Y,succ(X),Z1))))))),inference(fof_simplification, status(thm), [hyp2])).
% 0.52/0.53 fof(f8,axiom,(![Y]:(![X]:(![Z]:(![Z1]:(~r(Y,X,Z)|(~r(Z,X,Z1)|r(Y,succ(X),Z1))))))),inference(fof_nnf, status(thm), [f7])).
% 0.52/0.53 fof(f9,axiom,(![VAR4]:(![VAR3]:(![VAR2]:(![VAR1]:(~r(VAR4,VAR3,VAR2)|(~r(VAR2,VAR3,VAR1)|r(VAR4,succ(VAR3),VAR1))))))),inference(variable_rename, status(thm), [f8])).
% 0.52/0.53 fof(f10,axiom,(~r(VAR4,VAR3,VAR2)|(~r(VAR2,VAR3,VAR1)|r(VAR4,succ(VAR3),VAR1))),inference(shift_quantors, status(thm), [f9])).
% 0.52/0.54 cnf(cnf1,axiom,~r(X4,X5,X6)|~r(X6,X5,X7)|r(X4,succ(X5),X7),inference(split_conjunct, status(thm), [f10])).
% 0.52/0.54 cnf(c3,plain,~r(X10,zero,X11)|r(X10,succ(zero),succ(X11)),inference(resolution, status(thm), [cnf1, cnf0])).
% 0.52/0.54 cnf(c4,plain,r(X12,succ(zero),succ(succ(X12))),inference(resolution, status(thm), [c3, cnf0])).
% 0.52/0.54 cnf(c6,plain,~r(zero,zero,succ(zero)),inference(resolution, status(thm), [c4, cnf2])).
% 0.52/0.54 cnf(c7,plain,$false,inference(resolution, status(thm), [c6, cnf0])).
% 0.52/0.54 % SZS output end CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.52/0.54 # Filename : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.52/0.54 # Indexed : true
% 0.52/0.54 # Eval function name : PickGiven5
% 0.52/0.54 # Initial clauses : 3
% 0.52/0.54 # Processed clauses : 8
% 0.52/0.54 # Factors computed : 2
% 0.52/0.54 # Resolvents computed: 6
% 0.52/0.54 # Tautologies deleted: 0
% 0.52/0.54 # Forward subsumed : 1
% 0.52/0.54 # Backward subsumed : 0
% 0.52/0.54 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.52/0.54 # SZS Expected : Theorem
% 0.52/0.54 # time : 21ms
% 0.52/0.54
%------------------------------------------------------------------------------