TSTP Solution File: KLE070+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : KLE070+1 : TPTP v8.1.0. Released v4.0.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 : Sun Jul 17 02:25:33 EDT 2022
% Result : Theorem 5.45s 1.11s
% Output : Proof 5.45s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ sPE(addition(domain(sK0),multiplication(domain(sK0),domain(sK1))),domain(sK0)),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals)]) ).
cnf(g1,plain,
( ~ sPE(domain(sK0),addition(domain(sK0),multiplication(domain(sK0),domain(sK1))))
| sPE(addition(domain(sK0),multiplication(domain(sK0),domain(sK1))),domain(sK0)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g2,plain,
sPE(multiplication(domain(sK0),one),domain(sK0)),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',multiplicative_right_identity)]) ).
cnf(g3,plain,
sPE(domain(sK0),domain(sK0)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
sPE(multiplication(domain(sK0),domain(sK1)),multiplication(domain(sK0),domain(sK1))),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g5,plain,
( ~ sPE(multiplication(domain(sK0),one),domain(sK0))
| sPE(domain(sK0),multiplication(domain(sK0),one)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g6,plain,
( ~ sPE(multiplication(domain(sK0),one),domain(sK0))
| ~ sPE(multiplication(domain(sK0),domain(sK1)),multiplication(domain(sK0),domain(sK1)))
| sPE(addition(multiplication(domain(sK0),one),multiplication(domain(sK0),domain(sK1))),addition(domain(sK0),multiplication(domain(sK0),domain(sK1)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g7,plain,
sPE(addition(multiplication(domain(sK0),domain(sK1)),multiplication(domain(sK0),one)),addition(multiplication(domain(sK0),one),multiplication(domain(sK0),domain(sK1)))),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',additive_commutativity)]) ).
cnf(g8,plain,
( ~ sPE(domain(sK0),multiplication(domain(sK0),addition(domain(sK1),one)))
| ~ sPE(multiplication(domain(sK0),addition(domain(sK1),one)),addition(domain(sK0),multiplication(domain(sK0),domain(sK1))))
| sPE(domain(sK0),addition(domain(sK0),multiplication(domain(sK0),domain(sK1)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g9,plain,
( ~ sPE(domain(sK0),multiplication(domain(sK0),one))
| ~ sPE(multiplication(domain(sK0),one),multiplication(domain(sK0),addition(domain(sK1),one)))
| sPE(domain(sK0),multiplication(domain(sK0),addition(domain(sK1),one))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g10,plain,
( ~ sPE(domain(sK0),domain(sK0))
| ~ sPE(one,addition(domain(sK1),one))
| sPE(multiplication(domain(sK0),one),multiplication(domain(sK0),addition(domain(sK1),one))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
( ~ sPE(addition(domain(sK1),one),one)
| sPE(one,addition(domain(sK1),one)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
sPE(addition(domain(sK1),one),one),
inference(ground_cnf,[],[file('Axioms/KLE001+5.ax',domain3)]) ).
cnf(g13,plain,
( ~ sPE(multiplication(domain(sK0),addition(domain(sK1),one)),addition(multiplication(domain(sK0),one),multiplication(domain(sK0),domain(sK1))))
| ~ sPE(addition(multiplication(domain(sK0),one),multiplication(domain(sK0),domain(sK1))),addition(domain(sK0),multiplication(domain(sK0),domain(sK1))))
| sPE(multiplication(domain(sK0),addition(domain(sK1),one)),addition(domain(sK0),multiplication(domain(sK0),domain(sK1)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g14,plain,
( ~ sPE(multiplication(domain(sK0),addition(domain(sK1),one)),addition(multiplication(domain(sK0),domain(sK1)),multiplication(domain(sK0),one)))
| ~ sPE(addition(multiplication(domain(sK0),domain(sK1)),multiplication(domain(sK0),one)),addition(multiplication(domain(sK0),one),multiplication(domain(sK0),domain(sK1))))
| sPE(multiplication(domain(sK0),addition(domain(sK1),one)),addition(multiplication(domain(sK0),one),multiplication(domain(sK0),domain(sK1)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g15,plain,
sPE(multiplication(domain(sK0),addition(domain(sK1),one)),addition(multiplication(domain(sK0),domain(sK1)),multiplication(domain(sK0),one))),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',right_distributivity)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : KLE070+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.15 % Command : satcop --statistics %s
% 0.14/0.37 % Computer : n013.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 600
% 0.14/0.37 % DateTime : Thu Jun 16 12:01:59 EDT 2022
% 0.14/0.37 % CPUTime :
% 5.45/1.11 % symbols: 10
% 5.45/1.11 % clauses: 26
% 5.45/1.11 % start clauses: 1
% 5.45/1.11 % iterative deepening steps: 4753
% 5.45/1.11 % maximum path limit: 6
% 5.45/1.11 % literal attempts: 633900
% 5.45/1.11 % depth failures: 231683
% 5.45/1.11 % regularity failures: 75002
% 5.45/1.11 % tautology failures: 42034
% 5.45/1.11 % reductions: 0
% 5.45/1.11 % extensions: 629199
% 5.45/1.11 % SAT variables: 172285
% 5.45/1.11 % SAT clauses: 281079
% 5.45/1.11 % WalkSAT solutions: 281079
% 5.45/1.11 % CDCL solutions: 0
% 5.45/1.11 % SZS status Theorem for theBenchmark
% 5.45/1.11 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------