TSTP Solution File: KLE057+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : KLE057+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n010.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 : Sun Jul 17 02:25:30 EDT 2022
% Result : Theorem 0.12s 0.34s
% Output : Proof 0.12s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ sPE(domain(sK0),zero),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals)]) ).
cnf(g1,plain,
sPE(sK0,zero),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals)]) ).
cnf(g2,plain,
( ~ sPE(sK0,zero)
| sPE(domain(sK0),domain(zero)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g3,plain,
( ~ sPE(domain(sK0),domain(zero))
| ~ sPE(domain(zero),zero)
| sPE(domain(sK0),zero) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
sPE(domain(zero),zero),
inference(ground_cnf,[],[file('Axioms/KLE001+5.ax',domain4)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : KLE057+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : satcop --statistics %s
% 0.12/0.33 % Computer : n010.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 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 : Thu Jun 16 09:59:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % symbols: 9
% 0.12/0.34 % clauses: 27
% 0.12/0.34 % start clauses: 2
% 0.12/0.34 % iterative deepening steps: 22
% 0.12/0.34 % maximum path limit: 1
% 0.12/0.34 % literal attempts: 273
% 0.12/0.34 % depth failures: 191
% 0.12/0.34 % regularity failures: 3
% 0.12/0.34 % tautology failures: 5
% 0.12/0.34 % reductions: 25
% 0.12/0.34 % extensions: 217
% 0.12/0.34 % SAT variables: 124
% 0.12/0.34 % SAT clauses: 148
% 0.12/0.34 % WalkSAT solutions: 140
% 0.12/0.34 % CDCL solutions: 0
% 0.12/0.34 % SZS status Theorem for theBenchmark
% 0.12/0.34 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------