TSTP Solution File: SYN942+1 by JavaRes---1.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : JavaRes---1.3.0
% Problem : SYN942+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 : 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.48s 0.54s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN942+1 : TPTP v7.5.0. Released v3.1.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.13/0.33 % Computer : n011.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % RAMPerCPU : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Mar 10 17:51:24 EST 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.47 # 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.43/0.52 # hasConjecture: true isFOF: true
% 0.43/0.52 # ProofState(): heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.43/0.52 # HeuristicsClauseSet using eval functions: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.48/0.54 # -----------------
% 0.48/0.54 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.54
% 0.48/0.54 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.54 fof(prove_this,conjecture,(((![X]:(a(X)=>(b(X)|c(X))))&(~(![X]:(a(X)=>b(X)))))=>(?[X]:(a(X)&c(X)))),input).
% 0.48/0.54 fof(f1,negated_conjecture,(~(((![X]:(a(X)=>(b(X)|c(X))))&(~(![X]:(a(X)=>b(X)))))=>(?[X]:(a(X)&c(X))))),inference(assume_negation, status(cth), [prove_this])).
% 0.48/0.54 fof(f4,negated_conjecture,(~(((![X]:(a(X)=>(b(X)|c(X))))&(~(![X]:(a(X)=>b(X)))))=>(?[X]:(a(X)&c(X))))),inference(fof_simplification, status(thm), [f1])).
% 0.48/0.54 fof(f5,negated_conjecture,(((![X]:(~a(X)|(b(X)|c(X))))&(?[X]:(a(X)&~b(X))))&(![X]:(~a(X)|~c(X)))),inference(fof_nnf, status(thm), [f4])).
% 0.48/0.54 fof(f6,negated_conjecture,(((![VAR0]:(~a(VAR0)|(b(VAR0)|c(VAR0))))&(?[VAR1]:(a(VAR1)&~b(VAR1))))&(![VAR2]:(~a(VAR2)|~c(VAR2)))),inference(variable_rename, status(thm), [f5])).
% 0.48/0.54 fof(f7,negated_conjecture,(((![VAR0]:(~a(VAR0)|(b(VAR0)|c(VAR0))))&(a(skf3)&~b(skf3)))&(![VAR2]:(~a(VAR2)|~c(VAR2)))),inference(skolemize, status(esa), [f6])).
% 0.48/0.54 fof(f8,negated_conjecture,(((~a(VAR0)|(b(VAR0)|c(VAR0)))&(a(skf3)&~b(skf3)))&(~a(VAR2)|~c(VAR2))),inference(shift_quantors, status(thm), [f7])).
% 0.48/0.54 cnf(cnf1,negated_conjecture,a(skf3),inference(split_conjunct, status(thm), [f8])).
% 0.48/0.54 fof(prove_this,conjecture,(((![X]:(a(X)=>(b(X)|c(X))))&(~(![X]:(a(X)=>b(X)))))=>(?[X]:(a(X)&c(X)))),input).
% 0.48/0.54 fof(f1,negated_conjecture,(~(((![X]:(a(X)=>(b(X)|c(X))))&(~(![X]:(a(X)=>b(X)))))=>(?[X]:(a(X)&c(X))))),inference(assume_negation, status(cth), [prove_this])).
% 0.48/0.54 fof(f4,negated_conjecture,(~(((![X]:(a(X)=>(b(X)|c(X))))&(~(![X]:(a(X)=>b(X)))))=>(?[X]:(a(X)&c(X))))),inference(fof_simplification, status(thm), [f1])).
% 0.48/0.54 fof(f5,negated_conjecture,(((![X]:(~a(X)|(b(X)|c(X))))&(?[X]:(a(X)&~b(X))))&(![X]:(~a(X)|~c(X)))),inference(fof_nnf, status(thm), [f4])).
% 0.48/0.54 fof(f6,negated_conjecture,(((![VAR0]:(~a(VAR0)|(b(VAR0)|c(VAR0))))&(?[VAR1]:(a(VAR1)&~b(VAR1))))&(![VAR2]:(~a(VAR2)|~c(VAR2)))),inference(variable_rename, status(thm), [f5])).
% 0.48/0.54 fof(f7,negated_conjecture,(((![VAR0]:(~a(VAR0)|(b(VAR0)|c(VAR0))))&(a(skf3)&~b(skf3)))&(![VAR2]:(~a(VAR2)|~c(VAR2)))),inference(skolemize, status(esa), [f6])).
% 0.48/0.54 fof(f8,negated_conjecture,(((~a(VAR0)|(b(VAR0)|c(VAR0)))&(a(skf3)&~b(skf3)))&(~a(VAR2)|~c(VAR2))),inference(shift_quantors, status(thm), [f7])).
% 0.48/0.54 cnf(cnf3,negated_conjecture,~a(X1)|~c(X1),inference(split_conjunct, status(thm), [f8])).
% 0.48/0.55 fof(prove_this,conjecture,(((![X]:(a(X)=>(b(X)|c(X))))&(~(![X]:(a(X)=>b(X)))))=>(?[X]:(a(X)&c(X)))),input).
% 0.48/0.55 fof(f1,negated_conjecture,(~(((![X]:(a(X)=>(b(X)|c(X))))&(~(![X]:(a(X)=>b(X)))))=>(?[X]:(a(X)&c(X))))),inference(assume_negation, status(cth), [prove_this])).
% 0.48/0.55 fof(f4,negated_conjecture,(~(((![X]:(a(X)=>(b(X)|c(X))))&(~(![X]:(a(X)=>b(X)))))=>(?[X]:(a(X)&c(X))))),inference(fof_simplification, status(thm), [f1])).
% 0.48/0.55 fof(f5,negated_conjecture,(((![X]:(~a(X)|(b(X)|c(X))))&(?[X]:(a(X)&~b(X))))&(![X]:(~a(X)|~c(X)))),inference(fof_nnf, status(thm), [f4])).
% 0.48/0.55 fof(f6,negated_conjecture,(((![VAR0]:(~a(VAR0)|(b(VAR0)|c(VAR0))))&(?[VAR1]:(a(VAR1)&~b(VAR1))))&(![VAR2]:(~a(VAR2)|~c(VAR2)))),inference(variable_rename, status(thm), [f5])).
% 0.48/0.55 fof(f7,negated_conjecture,(((![VAR0]:(~a(VAR0)|(b(VAR0)|c(VAR0))))&(a(skf3)&~b(skf3)))&(![VAR2]:(~a(VAR2)|~c(VAR2)))),inference(skolemize, status(esa), [f6])).
% 0.48/0.55 fof(f8,negated_conjecture,(((~a(VAR0)|(b(VAR0)|c(VAR0)))&(a(skf3)&~b(skf3)))&(~a(VAR2)|~c(VAR2))),inference(shift_quantors, status(thm), [f7])).
% 0.48/0.55 cnf(cnf2,negated_conjecture,~b(skf3),inference(split_conjunct, status(thm), [f8])).
% 0.48/0.55 fof(prove_this,conjecture,(((![X]:(a(X)=>(b(X)|c(X))))&(~(![X]:(a(X)=>b(X)))))=>(?[X]:(a(X)&c(X)))),input).
% 0.48/0.55 fof(f1,negated_conjecture,(~(((![X]:(a(X)=>(b(X)|c(X))))&(~(![X]:(a(X)=>b(X)))))=>(?[X]:(a(X)&c(X))))),inference(assume_negation, status(cth), [prove_this])).
% 0.48/0.55 fof(f4,negated_conjecture,(~(((![X]:(a(X)=>(b(X)|c(X))))&(~(![X]:(a(X)=>b(X)))))=>(?[X]:(a(X)&c(X))))),inference(fof_simplification, status(thm), [f1])).
% 0.48/0.55 fof(f5,negated_conjecture,(((![X]:(~a(X)|(b(X)|c(X))))&(?[X]:(a(X)&~b(X))))&(![X]:(~a(X)|~c(X)))),inference(fof_nnf, status(thm), [f4])).
% 0.48/0.55 fof(f6,negated_conjecture,(((![VAR0]:(~a(VAR0)|(b(VAR0)|c(VAR0))))&(?[VAR1]:(a(VAR1)&~b(VAR1))))&(![VAR2]:(~a(VAR2)|~c(VAR2)))),inference(variable_rename, status(thm), [f5])).
% 0.48/0.55 fof(f7,negated_conjecture,(((![VAR0]:(~a(VAR0)|(b(VAR0)|c(VAR0))))&(a(skf3)&~b(skf3)))&(![VAR2]:(~a(VAR2)|~c(VAR2)))),inference(skolemize, status(esa), [f6])).
% 0.48/0.55 fof(f8,negated_conjecture,(((~a(VAR0)|(b(VAR0)|c(VAR0)))&(a(skf3)&~b(skf3)))&(~a(VAR2)|~c(VAR2))),inference(shift_quantors, status(thm), [f7])).
% 0.48/0.55 cnf(cnf1,negated_conjecture,a(skf3),inference(split_conjunct, status(thm), [f8])).
% 0.48/0.55 fof(prove_this,conjecture,(((![X]:(a(X)=>(b(X)|c(X))))&(~(![X]:(a(X)=>b(X)))))=>(?[X]:(a(X)&c(X)))),input).
% 0.48/0.55 fof(f1,negated_conjecture,(~(((![X]:(a(X)=>(b(X)|c(X))))&(~(![X]:(a(X)=>b(X)))))=>(?[X]:(a(X)&c(X))))),inference(assume_negation, status(cth), [prove_this])).
% 0.48/0.55 fof(f4,negated_conjecture,(~(((![X]:(a(X)=>(b(X)|c(X))))&(~(![X]:(a(X)=>b(X)))))=>(?[X]:(a(X)&c(X))))),inference(fof_simplification, status(thm), [f1])).
% 0.48/0.55 fof(f5,negated_conjecture,(((![X]:(~a(X)|(b(X)|c(X))))&(?[X]:(a(X)&~b(X))))&(![X]:(~a(X)|~c(X)))),inference(fof_nnf, status(thm), [f4])).
% 0.48/0.55 fof(f6,negated_conjecture,(((![VAR0]:(~a(VAR0)|(b(VAR0)|c(VAR0))))&(?[VAR1]:(a(VAR1)&~b(VAR1))))&(![VAR2]:(~a(VAR2)|~c(VAR2)))),inference(variable_rename, status(thm), [f5])).
% 0.48/0.55 fof(f7,negated_conjecture,(((![VAR0]:(~a(VAR0)|(b(VAR0)|c(VAR0))))&(a(skf3)&~b(skf3)))&(![VAR2]:(~a(VAR2)|~c(VAR2)))),inference(skolemize, status(esa), [f6])).
% 0.48/0.55 fof(f8,negated_conjecture,(((~a(VAR0)|(b(VAR0)|c(VAR0)))&(a(skf3)&~b(skf3)))&(~a(VAR2)|~c(VAR2))),inference(shift_quantors, status(thm), [f7])).
% 0.48/0.55 cnf(cnf0,negated_conjecture,~a(X2)|b(X2)|c(X2),inference(split_conjunct, status(thm), [f8])).
% 0.48/0.55 cnf(c0,plain,b(skf3)|c(skf3),inference(resolution, status(thm), [cnf0, cnf1])).
% 0.48/0.55 cnf(c1,plain,c(skf3),inference(resolution, status(thm), [c0, cnf2])).
% 0.48/0.55 cnf(c3,plain,~a(skf3),inference(resolution, status(thm), [c1, cnf3])).
% 0.48/0.55 cnf(c4,plain,$false,inference(resolution, status(thm), [c3, cnf1])).
% 0.48/0.55 % SZS output end CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.55 # Filename : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.55 # Indexed : true
% 0.48/0.55 # Eval function name : PickGiven5
% 0.48/0.55 # Initial clauses : 4
% 0.48/0.55 # Processed clauses : 7
% 0.48/0.55 # Factors computed : 0
% 0.48/0.55 # Resolvents computed: 5
% 0.48/0.55 # Tautologies deleted: 0
% 0.48/0.55 # Forward subsumed : 0
% 0.48/0.55 # Backward subsumed : 1
% 0.48/0.55 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.55 # SZS Expected : Theorem
% 0.48/0.55 # time : 20ms
% 0.48/0.55
%------------------------------------------------------------------------------