TSTP Solution File: SYO640+1 by JavaRes---1.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : JavaRes---1.3.0
% Problem : SYO640+1 : TPTP v7.5.0. Released v7.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 : Tue Mar 29 03:33:54 EDT 2022
% Result : Satisfiable 0.18s 0.54s
% Output : Saturation 0.18s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f5)
% Comments :
%------------------------------------------------------------------------------
cnf(cnf0,axiom,
f(skf10,skf11,skf9),
inference(split_conjunct,status(thm),[f5]) ).
cnf(cnf1,axiom,
f(skf11,skf10,skf9),
inference(split_conjunct,status(thm),[f5]) ).
cnf(cnf3,axiom,
~ f(skf11,skf12,skf9),
inference(split_conjunct,status(thm),[f5]) ).
cnf(cnf2,axiom,
( f(skf11,skf11,X1)
| ~ f(skf11,skf12,X1) ),
inference(split_conjunct,status(thm),[f5]) ).
cnf(cnf4,axiom,
( f(X2,X3,X4)
| ~ f(X2,X5,X4)
| ~ f(X5,X3,X4) ),
inference(split_conjunct,status(thm),[f5]) ).
cnf(c1,plain,
( f(X8,skf11,skf9)
| ~ f(X8,skf10,skf9) ),
inference(resolution,status(thm),[cnf4,cnf0]) ).
cnf(c3,plain,
f(skf11,skf11,skf9),
inference(resolution,status(thm),[c1,cnf1]) ).
cnf(c2,plain,
( f(X9,skf10,skf9)
| ~ f(X9,skf11,skf9) ),
inference(resolution,status(thm),[cnf4,cnf1]) ).
cnf(c5,plain,
f(skf10,skf10,skf9),
inference(resolution,status(thm),[c2,cnf0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SYO640+1 : TPTP v7.5.0. Released v7.1.0.
% 0.11/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 : n011.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 : Mon Mar 14 11:27:12 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.46 # Using default include path : /export/starexec/sandbox/benchmark
% 0.18/0.46 # INFO in ProverFOF.main(): Processing file /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.46 # ProverFOF.processTestFile(): filename: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.46 # 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.18/0.46 # ProverFOF.processTestFile(): evals: [Heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval] litSelect: LARGEST indexing: true delTaut: true forSub: true backSub: true]
% 0.18/0.50 # hasConjecture: false isFOF: true
% 0.18/0.50 # ProofState(): heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.18/0.50 # HeuristicsClauseSet using eval functions: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.18/0.54 # -----------------
% 0.18/0.54 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.54
% 0.18/0.54 % SZS output start Saturation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.54 cnf(cnf0,axiom,f(skf10,skf11,skf9),inference(split_conjunct, status(thm), [f5])).
% 0.18/0.54 cnf(cnf1,axiom,f(skf11,skf10,skf9),inference(split_conjunct, status(thm), [f5])).
% 0.18/0.54 cnf(cnf3,axiom,~f(skf11,skf12,skf9),inference(split_conjunct, status(thm), [f5])).
% 0.18/0.54 cnf(cnf2,axiom,f(skf11,skf11,X1)|~f(skf11,skf12,X1),inference(split_conjunct, status(thm), [f5])).
% 0.18/0.54 cnf(cnf4,axiom,f(X2,X3,X4)|~f(X2,X5,X4)|~f(X5,X3,X4),inference(split_conjunct, status(thm), [f5])).
% 0.18/0.54 cnf(c1,plain,f(X8,skf11,skf9)|~f(X8,skf10,skf9),inference(resolution, status(thm), [cnf4, cnf0])).
% 0.18/0.54 cnf(c3,plain,f(skf11,skf11,skf9),inference(resolution, status(thm), [c1, cnf1])).
% 0.18/0.54 cnf(c2,plain,f(X9,skf10,skf9)|~f(X9,skf11,skf9),inference(resolution, status(thm), [cnf4, cnf1])).
% 0.18/0.54 cnf(c5,plain,f(skf10,skf10,skf9),inference(resolution, status(thm), [c2, cnf0])).
% 0.18/0.54 % SZS output end Saturation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.54 # Filename : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.54 # Indexed : true
% 0.18/0.54 # Eval function name : PickGiven5
% 0.18/0.54 # Initial clauses : 5
% 0.18/0.54 # Processed clauses : 9
% 0.18/0.54 # Factors computed : 1
% 0.18/0.54 # Resolvents computed: 8
% 0.18/0.54 # Tautologies deleted: 3
% 0.18/0.54 # Forward subsumed : 2
% 0.18/0.54 # Backward subsumed : 0
% 0.18/0.54 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.54 # SZS Expected : Satisfiable
% 0.18/0.54 # time : 0ms
% 0.18/0.54
%------------------------------------------------------------------------------