TSTP Solution File: SWV135+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SWV135+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n013.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 : Wed Jul 20 21:27:39 EDT 2022
% Result : Theorem 119.37s 15.42s
% Output : Proof 120.13s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
leq(n2,pv1325),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',gauss_array_0005)]) ).
cnf(g1,plain,
~ leq(n0,pv1325),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',gauss_array_0005)]) ).
cnf(g2,plain,
( ~ leq(n0,n2)
| ~ leq(n2,pv1325)
| leq(n0,pv1325) ),
inference(ground_cnf,[],[file('Axioms/SWV003+0.ax',transitivity_leq)]) ).
cnf(g3,plain,
( ~ gt(n2,n0)
| leq(n0,n2) ),
inference(ground_cnf,[],[file('Axioms/SWV003+0.ax',leq_gt1)]) ).
cnf(g4,plain,
gt(n2,n0),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_2_0)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV135+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.07/0.13 % Command : satcop --statistics %s
% 0.14/0.34 % Computer : n013.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jun 14 17:13:59 EDT 2022
% 0.14/0.35 % CPUTime :
% 119.37/15.42 % symbols: 70
% 119.37/15.42 % clauses: 212
% 119.37/15.42 % start clauses: 9
% 119.37/15.42 % iterative deepening steps: 1336
% 119.37/15.42 % maximum path limit: 2
% 119.37/15.42 % literal attempts: 55157993
% 119.37/15.42 % depth failures: 53893903
% 119.37/15.42 % regularity failures: 26655
% 119.37/15.42 % tautology failures: 444605
% 119.37/15.42 % reductions: 419435
% 119.37/15.42 % extensions: 54732395
% 119.37/15.42 % SAT variables: 386211
% 119.37/15.42 % SAT clauses: 504127
% 119.37/15.42 % WalkSAT solutions: 504121
% 119.37/15.42 % CDCL solutions: 5
% 119.37/15.42 % SZS status Theorem for theBenchmark
% 119.37/15.42 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------