TSTP Solution File: SYN965+1 by JavaRes---1.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : JavaRes---1.3.0
% Problem : SYN965+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 : n025.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:56 EDT 2022
% Result : Theorem 0.10s 0.38s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.07 % Problem : SYN965+1 : TPTP v7.5.0. Released v3.1.0.
% 0.02/0.07 % 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.06/0.25 % Computer : n025.cluster.edu
% 0.06/0.25 % Model : x86_64 x86_64
% 0.06/0.25 % CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25 % RAMPerCPU : 8042.1875MB
% 0.06/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25 % CPULimit : 300
% 0.06/0.25 % WCLimit : 600
% 0.06/0.25 % DateTime : Thu Mar 10 18:31:45 EST 2022
% 0.06/0.26 % CPUTime :
% 0.10/0.32 # Using default include path : /export/starexec/sandbox/benchmark
% 0.10/0.32 # INFO in ProverFOF.main(): Processing file /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.32 # ProverFOF.processTestFile(): filename: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.32 # 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.10/0.32 # ProverFOF.processTestFile(): evals: [Heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval] litSelect: LARGEST indexing: true delTaut: true forSub: true backSub: true]
% 0.10/0.35 # hasConjecture: true isFOF: true
% 0.10/0.35 # ProofState(): heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.10/0.35 # HeuristicsClauseSet using eval functions: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.10/0.38 # -----------------
% 0.10/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.38
% 0.10/0.38 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.38 fof(prove_this,conjecture,(?[Z]:(![X]:(?[Y]:((p(Y,X)=>(?[W]:p(W,Y)))&((p(Z,Y)&p(Y,Z))=>p(Y,X)))))),input).
% 0.10/0.38 fof(f1,negated_conjecture,(~(?[Z]:(![X]:(?[Y]:((p(Y,X)=>(?[W]:p(W,Y)))&((p(Z,Y)&p(Y,Z))=>p(Y,X))))))),inference(assume_negation, status(cth), [prove_this])).
% 0.10/0.38 fof(f4,negated_conjecture,(~(?[Z]:(![X]:(?[Y]:((p(Y,X)=>(?[W]:p(W,Y)))&((p(Z,Y)&p(Y,Z))=>p(Y,X))))))),inference(fof_simplification, status(thm), [f1])).
% 0.10/0.38 fof(f5,negated_conjecture,(![Z]:(?[X]:(![Y]:((p(Y,X)&(![W]:~p(W,Y)))|((p(Z,Y)&p(Y,Z))&~p(Y,X)))))),inference(fof_nnf, status(thm), [f4])).
% 0.10/0.38 fof(f6,negated_conjecture,(![VAR3]:(?[VAR2]:(![VAR1]:((p(VAR1,VAR2)&(![VAR0]:~p(VAR0,VAR1)))|((p(VAR3,VAR1)&p(VAR1,VAR3))&~p(VAR1,VAR2)))))),inference(variable_rename, status(thm), [f5])).
% 0.10/0.38 fof(f7,negated_conjecture,(![VAR3]:(![VAR1]:((p(VAR1,skf4(VAR3))&(![VAR0]:~p(VAR0,VAR1)))|((p(VAR3,VAR1)&p(VAR1,VAR3))&~p(VAR1,skf4(VAR3)))))),inference(skolemize, status(esa), [f6])).
% 0.10/0.38 fof(f8,negated_conjecture,((p(VAR1,skf4(VAR3))&~p(VAR0,VAR1))|((p(VAR3,VAR1)&p(VAR1,VAR3))&~p(VAR1,skf4(VAR3)))),inference(shift_quantors, status(thm), [f7])).
% 0.10/0.38 fof(f9,negated_conjecture,((((p(VAR1,skf4(VAR3))|p(VAR3,VAR1))&(p(VAR1,skf4(VAR3))|p(VAR1,VAR3)))&(p(VAR1,skf4(VAR3))|~p(VAR1,skf4(VAR3))))&(((~p(VAR0,VAR1)|p(VAR3,VAR1))&(~p(VAR0,VAR1)|p(VAR1,VAR3)))&(~p(VAR0,VAR1)|~p(VAR1,skf4(VAR3))))),inference(distribute, status(thm), [f8])).
% 0.10/0.38 cnf(cnf5,negated_conjecture,~p(X11,X12)|~p(X12,skf4(X13)),inference(split_conjunct, status(thm), [f9])).
% 0.10/0.38 cnf(c8,plain,~p(skf4(X16),skf4(X16)),inference(factor, status(thm), [cnf5])).
% 0.10/0.38 fof(prove_this,conjecture,(?[Z]:(![X]:(?[Y]:((p(Y,X)=>(?[W]:p(W,Y)))&((p(Z,Y)&p(Y,Z))=>p(Y,X)))))),input).
% 0.10/0.38 fof(f1,negated_conjecture,(~(?[Z]:(![X]:(?[Y]:((p(Y,X)=>(?[W]:p(W,Y)))&((p(Z,Y)&p(Y,Z))=>p(Y,X))))))),inference(assume_negation, status(cth), [prove_this])).
% 0.10/0.38 fof(f4,negated_conjecture,(~(?[Z]:(![X]:(?[Y]:((p(Y,X)=>(?[W]:p(W,Y)))&((p(Z,Y)&p(Y,Z))=>p(Y,X))))))),inference(fof_simplification, status(thm), [f1])).
% 0.10/0.38 fof(f5,negated_conjecture,(![Z]:(?[X]:(![Y]:((p(Y,X)&(![W]:~p(W,Y)))|((p(Z,Y)&p(Y,Z))&~p(Y,X)))))),inference(fof_nnf, status(thm), [f4])).
% 0.10/0.38 fof(f6,negated_conjecture,(![VAR3]:(?[VAR2]:(![VAR1]:((p(VAR1,VAR2)&(![VAR0]:~p(VAR0,VAR1)))|((p(VAR3,VAR1)&p(VAR1,VAR3))&~p(VAR1,VAR2)))))),inference(variable_rename, status(thm), [f5])).
% 0.10/0.38 fof(f7,negated_conjecture,(![VAR3]:(![VAR1]:((p(VAR1,skf4(VAR3))&(![VAR0]:~p(VAR0,VAR1)))|((p(VAR3,VAR1)&p(VAR1,VAR3))&~p(VAR1,skf4(VAR3)))))),inference(skolemize, status(esa), [f6])).
% 0.10/0.38 fof(f8,negated_conjecture,((p(VAR1,skf4(VAR3))&~p(VAR0,VAR1))|((p(VAR3,VAR1)&p(VAR1,VAR3))&~p(VAR1,skf4(VAR3)))),inference(shift_quantors, status(thm), [f7])).
% 0.10/0.39 fof(f9,negated_conjecture,((((p(VAR1,skf4(VAR3))|p(VAR3,VAR1))&(p(VAR1,skf4(VAR3))|p(VAR1,VAR3)))&(p(VAR1,skf4(VAR3))|~p(VAR1,skf4(VAR3))))&(((~p(VAR0,VAR1)|p(VAR3,VAR1))&(~p(VAR0,VAR1)|p(VAR1,VAR3)))&(~p(VAR0,VAR1)|~p(VAR1,skf4(VAR3))))),inference(distribute, status(thm), [f8])).
% 0.10/0.39 cnf(cnf3,negated_conjecture,~p(X1,X2)|p(X3,X2),inference(split_conjunct, status(thm), [f9])).
% 0.10/0.39 fof(prove_this,conjecture,(?[Z]:(![X]:(?[Y]:((p(Y,X)=>(?[W]:p(W,Y)))&((p(Z,Y)&p(Y,Z))=>p(Y,X)))))),input).
% 0.10/0.39 fof(f1,negated_conjecture,(~(?[Z]:(![X]:(?[Y]:((p(Y,X)=>(?[W]:p(W,Y)))&((p(Z,Y)&p(Y,Z))=>p(Y,X))))))),inference(assume_negation, status(cth), [prove_this])).
% 0.10/0.39 fof(f4,negated_conjecture,(~(?[Z]:(![X]:(?[Y]:((p(Y,X)=>(?[W]:p(W,Y)))&((p(Z,Y)&p(Y,Z))=>p(Y,X))))))),inference(fof_simplification, status(thm), [f1])).
% 0.10/0.39 fof(f5,negated_conjecture,(![Z]:(?[X]:(![Y]:((p(Y,X)&(![W]:~p(W,Y)))|((p(Z,Y)&p(Y,Z))&~p(Y,X)))))),inference(fof_nnf, status(thm), [f4])).
% 0.10/0.39 fof(f6,negated_conjecture,(![VAR3]:(?[VAR2]:(![VAR1]:((p(VAR1,VAR2)&(![VAR0]:~p(VAR0,VAR1)))|((p(VAR3,VAR1)&p(VAR1,VAR3))&~p(VAR1,VAR2)))))),inference(variable_rename, status(thm), [f5])).
% 0.10/0.39 fof(f7,negated_conjecture,(![VAR3]:(![VAR1]:((p(VAR1,skf4(VAR3))&(![VAR0]:~p(VAR0,VAR1)))|((p(VAR3,VAR1)&p(VAR1,VAR3))&~p(VAR1,skf4(VAR3)))))),inference(skolemize, status(esa), [f6])).
% 0.10/0.39 fof(f8,negated_conjecture,((p(VAR1,skf4(VAR3))&~p(VAR0,VAR1))|((p(VAR3,VAR1)&p(VAR1,VAR3))&~p(VAR1,skf4(VAR3)))),inference(shift_quantors, status(thm), [f7])).
% 0.10/0.39 fof(f9,negated_conjecture,((((p(VAR1,skf4(VAR3))|p(VAR3,VAR1))&(p(VAR1,skf4(VAR3))|p(VAR1,VAR3)))&(p(VAR1,skf4(VAR3))|~p(VAR1,skf4(VAR3))))&(((~p(VAR0,VAR1)|p(VAR3,VAR1))&(~p(VAR0,VAR1)|p(VAR1,VAR3)))&(~p(VAR0,VAR1)|~p(VAR1,skf4(VAR3))))),inference(distribute, status(thm), [f8])).
% 0.10/0.39 cnf(cnf1,negated_conjecture,p(X9,skf4(X10))|p(X9,X10),inference(split_conjunct, status(thm), [f9])).
% 0.10/0.39 fof(prove_this,conjecture,(?[Z]:(![X]:(?[Y]:((p(Y,X)=>(?[W]:p(W,Y)))&((p(Z,Y)&p(Y,Z))=>p(Y,X)))))),input).
% 0.10/0.39 fof(f1,negated_conjecture,(~(?[Z]:(![X]:(?[Y]:((p(Y,X)=>(?[W]:p(W,Y)))&((p(Z,Y)&p(Y,Z))=>p(Y,X))))))),inference(assume_negation, status(cth), [prove_this])).
% 0.10/0.39 fof(f4,negated_conjecture,(~(?[Z]:(![X]:(?[Y]:((p(Y,X)=>(?[W]:p(W,Y)))&((p(Z,Y)&p(Y,Z))=>p(Y,X))))))),inference(fof_simplification, status(thm), [f1])).
% 0.10/0.39 fof(f5,negated_conjecture,(![Z]:(?[X]:(![Y]:((p(Y,X)&(![W]:~p(W,Y)))|((p(Z,Y)&p(Y,Z))&~p(Y,X)))))),inference(fof_nnf, status(thm), [f4])).
% 0.10/0.39 fof(f6,negated_conjecture,(![VAR3]:(?[VAR2]:(![VAR1]:((p(VAR1,VAR2)&(![VAR0]:~p(VAR0,VAR1)))|((p(VAR3,VAR1)&p(VAR1,VAR3))&~p(VAR1,VAR2)))))),inference(variable_rename, status(thm), [f5])).
% 0.10/0.39 fof(f7,negated_conjecture,(![VAR3]:(![VAR1]:((p(VAR1,skf4(VAR3))&(![VAR0]:~p(VAR0,VAR1)))|((p(VAR3,VAR1)&p(VAR1,VAR3))&~p(VAR1,skf4(VAR3)))))),inference(skolemize, status(esa), [f6])).
% 0.10/0.39 fof(f8,negated_conjecture,((p(VAR1,skf4(VAR3))&~p(VAR0,VAR1))|((p(VAR3,VAR1)&p(VAR1,VAR3))&~p(VAR1,skf4(VAR3)))),inference(shift_quantors, status(thm), [f7])).
% 0.10/0.39 fof(f9,negated_conjecture,((((p(VAR1,skf4(VAR3))|p(VAR3,VAR1))&(p(VAR1,skf4(VAR3))|p(VAR1,VAR3)))&(p(VAR1,skf4(VAR3))|~p(VAR1,skf4(VAR3))))&(((~p(VAR0,VAR1)|p(VAR3,VAR1))&(~p(VAR0,VAR1)|p(VAR1,VAR3)))&(~p(VAR0,VAR1)|~p(VAR1,skf4(VAR3))))),inference(distribute, status(thm), [f8])).
% 0.10/0.39 cnf(cnf5,negated_conjecture,~p(X11,X12)|~p(X12,skf4(X13)),inference(split_conjunct, status(thm), [f9])).
% 0.10/0.39 cnf(c8,plain,~p(skf4(X16),skf4(X16)),inference(factor, status(thm), [cnf5])).
% 0.10/0.39 cnf(c13,plain,p(skf4(X17),X17),inference(resolution, status(thm), [c8, cnf1])).
% 0.10/0.39 cnf(c17,plain,p(X18,X19),inference(resolution, status(thm), [c13, cnf3])).
% 0.10/0.39 cnf(c23,plain,$false,inference(resolution, status(thm), [c17, c8])).
% 0.10/0.39 % SZS output end CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.39 # Filename : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.39 # Indexed : true
% 0.10/0.39 # Eval function name : PickGiven5
% 0.10/0.39 # Initial clauses : 6
% 0.10/0.39 # Processed clauses : 8
% 0.10/0.39 # Factors computed : 1
% 0.10/0.39 # Resolvents computed: 23
% 0.10/0.39 # Tautologies deleted: 1
% 0.10/0.39 # Forward subsumed : 0
% 0.10/0.39 # Backward subsumed : 5
% 0.10/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.39 # SZS Expected : Theorem
% 0.10/0.39 # time : 26ms
% 0.10/0.39
%------------------------------------------------------------------------------