TSTP Solution File: KLE052+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : KLE052+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n022.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:29 EDT 2022
% Result : Theorem 104.29s 13.51s
% Output : Proof 104.29s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ sPE(multiplication(domain(sK0),sK0),sK0),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals)]) ).
cnf(g1,plain,
( ~ sPE(sK0,multiplication(domain(sK0),sK0))
| sPE(multiplication(domain(sK0),sK0),sK0) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g2,plain,
sPE(multiplication(one,sK0),sK0),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',multiplicative_left_identity)]) ).
cnf(g3,plain,
sPE(addition(sK0,multiplication(domain(sK0),sK0)),multiplication(domain(sK0),sK0)),
inference(ground_cnf,[],[file('Axioms/KLE001+5.ax',domain1)]) ).
cnf(g4,plain,
sPE(sK0,sK0),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g5,plain,
( ~ sPE(addition(sK0,multiplication(domain(sK0),sK0)),multiplication(domain(sK0),sK0))
| leq(sK0,multiplication(domain(sK0),sK0)) ),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',order)]) ).
cnf(g6,plain,
sPE(multiplication(domain(sK0),sK0),multiplication(domain(sK0),sK0)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g7,plain,
sPE(addition(domain(sK0),one),one),
inference(ground_cnf,[],[file('Axioms/KLE001+5.ax',domain3)]) ).
cnf(g8,plain,
( ~ sPE(sK0,addition(multiplication(domain(sK0),sK0),multiplication(one,sK0)))
| ~ sPE(addition(multiplication(domain(sK0),sK0),multiplication(one,sK0)),multiplication(domain(sK0),sK0))
| sPE(sK0,multiplication(domain(sK0),sK0)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g9,plain,
( ~ sPE(addition(multiplication(domain(sK0),sK0),multiplication(one,sK0)),addition(multiplication(one,sK0),multiplication(domain(sK0),sK0)))
| ~ sPE(addition(multiplication(one,sK0),multiplication(domain(sK0),sK0)),multiplication(domain(sK0),sK0))
| sPE(addition(multiplication(domain(sK0),sK0),multiplication(one,sK0)),multiplication(domain(sK0),sK0)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g10,plain,
( ~ leq(multiplication(one,sK0),multiplication(domain(sK0),sK0))
| sPE(addition(multiplication(one,sK0),multiplication(domain(sK0),sK0)),multiplication(domain(sK0),sK0)) ),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',order)]) ).
cnf(g11,plain,
sPE(addition(multiplication(domain(sK0),sK0),multiplication(one,sK0)),addition(multiplication(one,sK0),multiplication(domain(sK0),sK0))),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',additive_commutativity)]) ).
cnf(g12,plain,
sPE(multiplication(addition(domain(sK0),one),sK0),addition(multiplication(domain(sK0),sK0),multiplication(one,sK0))),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',left_distributivity)]) ).
cnf(g13,plain,
( ~ sPE(multiplication(one,sK0),sK0)
| sPE(sK0,multiplication(one,sK0)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g14,plain,
( ~ sPE(sK0,multiplication(one,sK0))
| ~ sPE(multiplication(domain(sK0),sK0),multiplication(domain(sK0),sK0))
| ~ leq(sK0,multiplication(domain(sK0),sK0))
| leq(multiplication(one,sK0),multiplication(domain(sK0),sK0)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g15,plain,
( ~ sPE(sK0,multiplication(addition(domain(sK0),one),sK0))
| ~ sPE(multiplication(addition(domain(sK0),one),sK0),addition(multiplication(domain(sK0),sK0),multiplication(one,sK0)))
| sPE(sK0,addition(multiplication(domain(sK0),sK0),multiplication(one,sK0))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g16,plain,
( ~ sPE(multiplication(addition(domain(sK0),one),sK0),sK0)
| sPE(sK0,multiplication(addition(domain(sK0),one),sK0)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g17,plain,
( ~ sPE(multiplication(addition(domain(sK0),one),sK0),multiplication(one,sK0))
| ~ sPE(multiplication(one,sK0),sK0)
| sPE(multiplication(addition(domain(sK0),one),sK0),sK0) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g18,plain,
( ~ sPE(addition(domain(sK0),one),one)
| ~ sPE(sK0,sK0)
| sPE(multiplication(addition(domain(sK0),one),sK0),multiplication(one,sK0)) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : KLE052+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.15 % Command : satcop --statistics %s
% 0.14/0.36 % Computer : n022.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Thu Jun 16 13:45:47 EDT 2022
% 0.14/0.36 % CPUTime :
% 104.29/13.51 % symbols: 9
% 104.29/13.51 % clauses: 26
% 104.29/13.51 % start clauses: 1
% 104.29/13.51 % iterative deepening steps: 24781
% 104.29/13.51 % maximum path limit: 12
% 104.29/13.51 % literal attempts: 6166612
% 104.29/13.51 % depth failures: 1684079
% 104.29/13.51 % regularity failures: 859108
% 104.29/13.51 % tautology failures: 424920
% 104.29/13.51 % reductions: 0
% 104.29/13.51 % extensions: 6142059
% 104.29/13.51 % SAT variables: 2472621
% 104.29/13.51 % SAT clauses: 3901296
% 104.29/13.51 % WalkSAT solutions: 3901289
% 104.29/13.51 % CDCL solutions: 4
% 104.29/13.51 % SZS status Theorem for theBenchmark
% 104.29/13.51 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------