TSTP Solution File: KLE002+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : KLE002+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n020.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:09 EDT 2022
% Result : Theorem 0.21s 0.37s
% Output : Proof 0.21s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
leq(sK0,sK1),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals)]) ).
cnf(g1,plain,
~ leq(multiplication(sK0,sK2),multiplication(sK1,sK2)),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals)]) ).
cnf(g2,plain,
( ~ leq(sK0,sK1)
| sPE(addition(sK0,sK1),sK1) ),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',order)]) ).
cnf(g3,plain,
( ~ sPE(addition(multiplication(sK0,sK2),multiplication(sK1,sK2)),multiplication(sK1,sK2))
| leq(multiplication(sK0,sK2),multiplication(sK1,sK2)) ),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',order)]) ).
cnf(g4,plain,
( ~ sPE(addition(sK0,sK1),sK1)
| sPE(sK1,addition(sK0,sK1)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g5,plain,
( ~ sPE(multiplication(sK1,sK2),addition(multiplication(sK0,sK2),multiplication(sK1,sK2)))
| sPE(addition(multiplication(sK0,sK2),multiplication(sK1,sK2)),multiplication(sK1,sK2)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g6,plain,
sPE(sK2,sK2),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g7,plain,
( ~ sPE(multiplication(sK1,sK2),multiplication(addition(sK0,sK1),sK2))
| ~ sPE(multiplication(addition(sK0,sK1),sK2),addition(multiplication(sK0,sK2),multiplication(sK1,sK2)))
| sPE(multiplication(sK1,sK2),addition(multiplication(sK0,sK2),multiplication(sK1,sK2))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
sPE(multiplication(addition(sK0,sK1),sK2),addition(multiplication(sK0,sK2),multiplication(sK1,sK2))),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',left_distributivity)]) ).
cnf(g9,plain,
( ~ sPE(sK1,addition(sK0,sK1))
| ~ sPE(sK2,sK2)
| sPE(multiplication(sK1,sK2),multiplication(addition(sK0,sK1),sK2)) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : KLE002+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.14 % Command : satcop --statistics %s
% 0.14/0.35 % Computer : n020.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Thu Jun 16 13:12:34 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.37 % symbols: 10
% 0.21/0.37 % clauses: 21
% 0.21/0.37 % start clauses: 2
% 0.21/0.37 % iterative deepening steps: 206
% 0.21/0.37 % maximum path limit: 4
% 0.21/0.37 % literal attempts: 12070
% 0.21/0.37 % depth failures: 7435
% 0.21/0.37 % regularity failures: 747
% 0.21/0.37 % tautology failures: 464
% 0.21/0.37 % reductions: 203
% 0.21/0.37 % extensions: 11596
% 0.21/0.37 % SAT variables: 3273
% 0.21/0.37 % SAT clauses: 4091
% 0.21/0.37 % WalkSAT solutions: 4087
% 0.21/0.37 % CDCL solutions: 0
% 0.21/0.37 % SZS status Theorem for theBenchmark
% 0.21/0.37 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------