TSTP Solution File: SYN944+1 by JavaRes---1.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : JavaRes---1.3.0
% Problem : SYN944+1 : TPTP v7.5.0. Released v3.1.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 : n011.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:52 EDT 2022
% Result : Theorem 0.19s 0.56s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN944+1 : TPTP v7.5.0. Released v3.1.0.
% 0.07/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.34 % Computer : n011.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 17:57:09 EST 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.47 # Using default include path : /export/starexec/sandbox2/benchmark
% 0.19/0.48 # INFO in ProverFOF.main(): Processing file /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.48 # ProverFOF.processTestFile(): filename: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.48 # 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.48 # ProverFOF.processTestFile(): evals: [Heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval] litSelect: LARGEST indexing: true delTaut: true forSub: true backSub: true]
% 0.19/0.54 # hasConjecture: true isFOF: true
% 0.19/0.54 # ProofState(): heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.19/0.54 # HeuristicsClauseSet using eval functions: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.19/0.56 # -----------------
% 0.19/0.56 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.56
% 0.19/0.56 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.56 fof(prove_this,conjecture,(![A]:(![B]:(![C]:(((((s(A)&s(B))&r(B,C))&(![X]:(s(X)=>p(X))))&(![X]:(![Y]:(r(X,Y)=>q(X,Y)))))=>(?[X]:(?[Y]:(p(X)&q(X,Y)))))))),input).
% 0.19/0.56 fof(f1,negated_conjecture,(~(![A]:(![B]:(![C]:(((((s(A)&s(B))&r(B,C))&(![X]:(s(X)=>p(X))))&(![X]:(![Y]:(r(X,Y)=>q(X,Y)))))=>(?[X]:(?[Y]:(p(X)&q(X,Y))))))))),inference(assume_negation, status(cth), [prove_this])).
% 0.19/0.56 fof(f4,negated_conjecture,(~(![A]:(![B]:(![C]:(((((s(A)&s(B))&r(B,C))&(![X]:(s(X)=>p(X))))&(![X]:(![Y]:(r(X,Y)=>q(X,Y)))))=>(?[X]:(?[Y]:(p(X)&q(X,Y))))))))),inference(fof_simplification, status(thm), [f1])).
% 0.19/0.56 fof(f5,negated_conjecture,(?[A]:(?[B]:(?[C]:(((((s(A)&s(B))&r(B,C))&(![X]:(~s(X)|p(X))))&(![X]:(![Y]:(~r(X,Y)|q(X,Y)))))&(![X]:(![Y]:(~p(X)|~q(X,Y)))))))),inference(fof_nnf, status(thm), [f4])).
% 0.19/0.56 fof(f6,negated_conjecture,(?[VAR7]:(?[VAR6]:(?[VAR5]:(((((s(VAR7)&s(VAR6))&r(VAR6,VAR5))&(![VAR0]:(~s(VAR0)|p(VAR0))))&(![VAR2]:(![VAR1]:(~r(VAR2,VAR1)|q(VAR2,VAR1)))))&(![VAR4]:(![VAR3]:(~p(VAR4)|~q(VAR4,VAR3)))))))),inference(variable_rename, status(thm), [f5])).
% 0.19/0.56 fof(f7,negated_conjecture,(((((s(skf8)&s(skf9))&r(skf9,skf10))&(![VAR0]:(~s(VAR0)|p(VAR0))))&(![VAR2]:(![VAR1]:(~r(VAR2,VAR1)|q(VAR2,VAR1)))))&(![VAR4]:(![VAR3]:(~p(VAR4)|~q(VAR4,VAR3))))),inference(skolemize, status(esa), [f6])).
% 0.19/0.56 fof(f8,negated_conjecture,(((((s(skf8)&s(skf9))&r(skf9,skf10))&(~s(VAR0)|p(VAR0)))&(~r(VAR2,VAR1)|q(VAR2,VAR1)))&(~p(VAR4)|~q(VAR4,VAR3))),inference(shift_quantors, status(thm), [f7])).
% 0.19/0.56 cnf(cnf1,negated_conjecture,s(skf9),inference(split_conjunct, status(thm), [f8])).
% 0.19/0.56 fof(prove_this,conjecture,(![A]:(![B]:(![C]:(((((s(A)&s(B))&r(B,C))&(![X]:(s(X)=>p(X))))&(![X]:(![Y]:(r(X,Y)=>q(X,Y)))))=>(?[X]:(?[Y]:(p(X)&q(X,Y)))))))),input).
% 0.19/0.56 fof(f1,negated_conjecture,(~(![A]:(![B]:(![C]:(((((s(A)&s(B))&r(B,C))&(![X]:(s(X)=>p(X))))&(![X]:(![Y]:(r(X,Y)=>q(X,Y)))))=>(?[X]:(?[Y]:(p(X)&q(X,Y))))))))),inference(assume_negation, status(cth), [prove_this])).
% 0.19/0.56 fof(f4,negated_conjecture,(~(![A]:(![B]:(![C]:(((((s(A)&s(B))&r(B,C))&(![X]:(s(X)=>p(X))))&(![X]:(![Y]:(r(X,Y)=>q(X,Y)))))=>(?[X]:(?[Y]:(p(X)&q(X,Y))))))))),inference(fof_simplification, status(thm), [f1])).
% 0.19/0.56 fof(f5,negated_conjecture,(?[A]:(?[B]:(?[C]:(((((s(A)&s(B))&r(B,C))&(![X]:(~s(X)|p(X))))&(![X]:(![Y]:(~r(X,Y)|q(X,Y)))))&(![X]:(![Y]:(~p(X)|~q(X,Y)))))))),inference(fof_nnf, status(thm), [f4])).
% 0.19/0.56 fof(f6,negated_conjecture,(?[VAR7]:(?[VAR6]:(?[VAR5]:(((((s(VAR7)&s(VAR6))&r(VAR6,VAR5))&(![VAR0]:(~s(VAR0)|p(VAR0))))&(![VAR2]:(![VAR1]:(~r(VAR2,VAR1)|q(VAR2,VAR1)))))&(![VAR4]:(![VAR3]:(~p(VAR4)|~q(VAR4,VAR3)))))))),inference(variable_rename, status(thm), [f5])).
% 0.19/0.56 fof(f7,negated_conjecture,(((((s(skf8)&s(skf9))&r(skf9,skf10))&(![VAR0]:(~s(VAR0)|p(VAR0))))&(![VAR2]:(![VAR1]:(~r(VAR2,VAR1)|q(VAR2,VAR1)))))&(![VAR4]:(![VAR3]:(~p(VAR4)|~q(VAR4,VAR3))))),inference(skolemize, status(esa), [f6])).
% 0.19/0.56 fof(f8,negated_conjecture,(((((s(skf8)&s(skf9))&r(skf9,skf10))&(~s(VAR0)|p(VAR0)))&(~r(VAR2,VAR1)|q(VAR2,VAR1)))&(~p(VAR4)|~q(VAR4,VAR3))),inference(shift_quantors, status(thm), [f7])).
% 0.19/0.56 cnf(cnf3,negated_conjecture,~s(X1)|p(X1),inference(split_conjunct, status(thm), [f8])).
% 0.19/0.56 cnf(c1,plain,p(skf9),inference(resolution, status(thm), [cnf3, cnf1])).
% 0.19/0.56 fof(prove_this,conjecture,(![A]:(![B]:(![C]:(((((s(A)&s(B))&r(B,C))&(![X]:(s(X)=>p(X))))&(![X]:(![Y]:(r(X,Y)=>q(X,Y)))))=>(?[X]:(?[Y]:(p(X)&q(X,Y)))))))),input).
% 0.19/0.56 fof(f1,negated_conjecture,(~(![A]:(![B]:(![C]:(((((s(A)&s(B))&r(B,C))&(![X]:(s(X)=>p(X))))&(![X]:(![Y]:(r(X,Y)=>q(X,Y)))))=>(?[X]:(?[Y]:(p(X)&q(X,Y))))))))),inference(assume_negation, status(cth), [prove_this])).
% 0.19/0.56 fof(f4,negated_conjecture,(~(![A]:(![B]:(![C]:(((((s(A)&s(B))&r(B,C))&(![X]:(s(X)=>p(X))))&(![X]:(![Y]:(r(X,Y)=>q(X,Y)))))=>(?[X]:(?[Y]:(p(X)&q(X,Y))))))))),inference(fof_simplification, status(thm), [f1])).
% 0.19/0.56 fof(f5,negated_conjecture,(?[A]:(?[B]:(?[C]:(((((s(A)&s(B))&r(B,C))&(![X]:(~s(X)|p(X))))&(![X]:(![Y]:(~r(X,Y)|q(X,Y)))))&(![X]:(![Y]:(~p(X)|~q(X,Y)))))))),inference(fof_nnf, status(thm), [f4])).
% 0.19/0.56 fof(f6,negated_conjecture,(?[VAR7]:(?[VAR6]:(?[VAR5]:(((((s(VAR7)&s(VAR6))&r(VAR6,VAR5))&(![VAR0]:(~s(VAR0)|p(VAR0))))&(![VAR2]:(![VAR1]:(~r(VAR2,VAR1)|q(VAR2,VAR1)))))&(![VAR4]:(![VAR3]:(~p(VAR4)|~q(VAR4,VAR3)))))))),inference(variable_rename, status(thm), [f5])).
% 0.19/0.56 fof(f7,negated_conjecture,(((((s(skf8)&s(skf9))&r(skf9,skf10))&(![VAR0]:(~s(VAR0)|p(VAR0))))&(![VAR2]:(![VAR1]:(~r(VAR2,VAR1)|q(VAR2,VAR1)))))&(![VAR4]:(![VAR3]:(~p(VAR4)|~q(VAR4,VAR3))))),inference(skolemize, status(esa), [f6])).
% 0.19/0.56 fof(f8,negated_conjecture,(((((s(skf8)&s(skf9))&r(skf9,skf10))&(~s(VAR0)|p(VAR0)))&(~r(VAR2,VAR1)|q(VAR2,VAR1)))&(~p(VAR4)|~q(VAR4,VAR3))),inference(shift_quantors, status(thm), [f7])).
% 0.19/0.56 cnf(cnf2,negated_conjecture,r(skf9,skf10),inference(split_conjunct, status(thm), [f8])).
% 0.19/0.56 fof(prove_this,conjecture,(![A]:(![B]:(![C]:(((((s(A)&s(B))&r(B,C))&(![X]:(s(X)=>p(X))))&(![X]:(![Y]:(r(X,Y)=>q(X,Y)))))=>(?[X]:(?[Y]:(p(X)&q(X,Y)))))))),input).
% 0.19/0.56 fof(f1,negated_conjecture,(~(![A]:(![B]:(![C]:(((((s(A)&s(B))&r(B,C))&(![X]:(s(X)=>p(X))))&(![X]:(![Y]:(r(X,Y)=>q(X,Y)))))=>(?[X]:(?[Y]:(p(X)&q(X,Y))))))))),inference(assume_negation, status(cth), [prove_this])).
% 0.19/0.56 fof(f4,negated_conjecture,(~(![A]:(![B]:(![C]:(((((s(A)&s(B))&r(B,C))&(![X]:(s(X)=>p(X))))&(![X]:(![Y]:(r(X,Y)=>q(X,Y)))))=>(?[X]:(?[Y]:(p(X)&q(X,Y))))))))),inference(fof_simplification, status(thm), [f1])).
% 0.19/0.56 fof(f5,negated_conjecture,(?[A]:(?[B]:(?[C]:(((((s(A)&s(B))&r(B,C))&(![X]:(~s(X)|p(X))))&(![X]:(![Y]:(~r(X,Y)|q(X,Y)))))&(![X]:(![Y]:(~p(X)|~q(X,Y)))))))),inference(fof_nnf, status(thm), [f4])).
% 0.19/0.56 fof(f6,negated_conjecture,(?[VAR7]:(?[VAR6]:(?[VAR5]:(((((s(VAR7)&s(VAR6))&r(VAR6,VAR5))&(![VAR0]:(~s(VAR0)|p(VAR0))))&(![VAR2]:(![VAR1]:(~r(VAR2,VAR1)|q(VAR2,VAR1)))))&(![VAR4]:(![VAR3]:(~p(VAR4)|~q(VAR4,VAR3)))))))),inference(variable_rename, status(thm), [f5])).
% 0.19/0.57 fof(f7,negated_conjecture,(((((s(skf8)&s(skf9))&r(skf9,skf10))&(![VAR0]:(~s(VAR0)|p(VAR0))))&(![VAR2]:(![VAR1]:(~r(VAR2,VAR1)|q(VAR2,VAR1)))))&(![VAR4]:(![VAR3]:(~p(VAR4)|~q(VAR4,VAR3))))),inference(skolemize, status(esa), [f6])).
% 0.19/0.57 fof(f8,negated_conjecture,(((((s(skf8)&s(skf9))&r(skf9,skf10))&(~s(VAR0)|p(VAR0)))&(~r(VAR2,VAR1)|q(VAR2,VAR1)))&(~p(VAR4)|~q(VAR4,VAR3))),inference(shift_quantors, status(thm), [f7])).
% 0.19/0.57 cnf(cnf4,negated_conjecture,~r(X2,X3)|q(X2,X3),inference(split_conjunct, status(thm), [f8])).
% 0.19/0.57 cnf(c2,plain,q(skf9,skf10),inference(resolution, status(thm), [cnf4, cnf2])).
% 0.19/0.57 fof(prove_this,conjecture,(![A]:(![B]:(![C]:(((((s(A)&s(B))&r(B,C))&(![X]:(s(X)=>p(X))))&(![X]:(![Y]:(r(X,Y)=>q(X,Y)))))=>(?[X]:(?[Y]:(p(X)&q(X,Y)))))))),input).
% 0.19/0.57 fof(f1,negated_conjecture,(~(![A]:(![B]:(![C]:(((((s(A)&s(B))&r(B,C))&(![X]:(s(X)=>p(X))))&(![X]:(![Y]:(r(X,Y)=>q(X,Y)))))=>(?[X]:(?[Y]:(p(X)&q(X,Y))))))))),inference(assume_negation, status(cth), [prove_this])).
% 0.19/0.57 fof(f4,negated_conjecture,(~(![A]:(![B]:(![C]:(((((s(A)&s(B))&r(B,C))&(![X]:(s(X)=>p(X))))&(![X]:(![Y]:(r(X,Y)=>q(X,Y)))))=>(?[X]:(?[Y]:(p(X)&q(X,Y))))))))),inference(fof_simplification, status(thm), [f1])).
% 0.19/0.57 fof(f5,negated_conjecture,(?[A]:(?[B]:(?[C]:(((((s(A)&s(B))&r(B,C))&(![X]:(~s(X)|p(X))))&(![X]:(![Y]:(~r(X,Y)|q(X,Y)))))&(![X]:(![Y]:(~p(X)|~q(X,Y)))))))),inference(fof_nnf, status(thm), [f4])).
% 0.19/0.57 fof(f6,negated_conjecture,(?[VAR7]:(?[VAR6]:(?[VAR5]:(((((s(VAR7)&s(VAR6))&r(VAR6,VAR5))&(![VAR0]:(~s(VAR0)|p(VAR0))))&(![VAR2]:(![VAR1]:(~r(VAR2,VAR1)|q(VAR2,VAR1)))))&(![VAR4]:(![VAR3]:(~p(VAR4)|~q(VAR4,VAR3)))))))),inference(variable_rename, status(thm), [f5])).
% 0.19/0.57 fof(f7,negated_conjecture,(((((s(skf8)&s(skf9))&r(skf9,skf10))&(![VAR0]:(~s(VAR0)|p(VAR0))))&(![VAR2]:(![VAR1]:(~r(VAR2,VAR1)|q(VAR2,VAR1)))))&(![VAR4]:(![VAR3]:(~p(VAR4)|~q(VAR4,VAR3))))),inference(skolemize, status(esa), [f6])).
% 0.19/0.57 fof(f8,negated_conjecture,(((((s(skf8)&s(skf9))&r(skf9,skf10))&(~s(VAR0)|p(VAR0)))&(~r(VAR2,VAR1)|q(VAR2,VAR1)))&(~p(VAR4)|~q(VAR4,VAR3))),inference(shift_quantors, status(thm), [f7])).
% 0.19/0.57 cnf(cnf5,negated_conjecture,~p(X4)|~q(X4,X5),inference(split_conjunct, status(thm), [f8])).
% 0.19/0.57 cnf(c3,plain,~p(skf9),inference(resolution, status(thm), [cnf5, c2])).
% 0.19/0.57 cnf(c4,plain,$false,inference(resolution, status(thm), [c3, c1])).
% 0.19/0.57 % SZS output end CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.57 # Filename : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.57 # Indexed : true
% 0.19/0.57 # Eval function name : PickGiven5
% 0.19/0.57 # Initial clauses : 6
% 0.19/0.57 # Processed clauses : 10
% 0.19/0.57 # Factors computed : 0
% 0.19/0.57 # Resolvents computed: 5
% 0.19/0.57 # Tautologies deleted: 0
% 0.19/0.57 # Forward subsumed : 0
% 0.19/0.57 # Backward subsumed : 0
% 0.19/0.57 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.57 # SZS Expected : Theorem
% 0.19/0.57 # time : 18ms
% 0.19/0.57
%------------------------------------------------------------------------------