TSTP Solution File: KLE021+2 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : KLE021+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n028.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:16 EDT 2022
% Result : Theorem 0.19s 0.51s
% Output : Proof 0.19s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
test(sK2),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals)]) ).
cnf(g1,plain,
( ~ leq(addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)),sK1)
| ~ leq(sK1,addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals)]) ).
cnf(g2,plain,
( ~ sPE(c(sK2),c(sK2))
| ~ test(sK2)
| complement(sK2,c(sK2)) ),
inference(ground_cnf,[],[file('Axioms/KLE001+1.ax',test_3)]) ).
cnf(g3,plain,
sPE(c(sK2),c(sK2)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
( ~ complement(sK2,c(sK2))
| sPE(addition(c(sK2),sK2),one) ),
inference(ground_cnf,[],[file('Axioms/KLE001+1.ax',test_2)]) ).
cnf(g5,plain,
sPE(multiplication(one,sK1),sK1),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',multiplicative_left_identity)]) ).
cnf(g6,plain,
sPE(addition(addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)),addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1))),addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1))),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',additive_idempotence)]) ).
cnf(g7,plain,
sPE(sK1,sK1),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
( ~ sPE(addition(c(sK2),sK2),one)
| ~ sPE(sK1,sK1)
| sPE(multiplication(addition(c(sK2),sK2),sK1),multiplication(one,sK1)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g9,plain,
( ~ sPE(addition(addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)),addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1))),addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)))
| leq(addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)),addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1))) ),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',order)]) ).
cnf(g10,plain,
sPE(addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)),addition(multiplication(c(sK2),sK1),multiplication(sK2,sK1))),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',additive_commutativity)]) ).
cnf(g11,plain,
sPE(multiplication(addition(sK2,c(sK2)),sK1),addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1))),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',left_distributivity)]) ).
cnf(g12,plain,
sPE(multiplication(addition(c(sK2),sK2),sK1),addition(multiplication(c(sK2),sK1),multiplication(sK2,sK1))),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',left_distributivity)]) ).
cnf(g13,plain,
( ~ sPE(addition(addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)),addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1))),addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)))
| sPE(addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)),addition(addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)),addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g14,plain,
( ~ sPE(addition(multiplication(c(sK2),sK1),multiplication(sK2,sK1)),sK1)
| ~ sPE(addition(addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)),addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1))),addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)))
| ~ leq(addition(multiplication(c(sK2),sK1),multiplication(sK2,sK1)),addition(addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)),addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1))))
| leq(sK1,addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g15,plain,
( ~ sPE(addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)),addition(multiplication(c(sK2),sK1),multiplication(sK2,sK1)))
| ~ sPE(addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)),addition(addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)),addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1))))
| ~ leq(addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)),addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)))
| leq(addition(multiplication(c(sK2),sK1),multiplication(sK2,sK1)),addition(addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)),addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g16,plain,
( ~ sPE(multiplication(addition(c(sK2),sK2),sK1),multiplication(one,sK1))
| ~ sPE(multiplication(one,sK1),sK1)
| sPE(multiplication(addition(c(sK2),sK2),sK1),sK1) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g17,plain,
( ~ sPE(multiplication(addition(sK2,c(sK2)),sK1),addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)))
| sPE(addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)),multiplication(addition(sK2,c(sK2)),sK1)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g18,plain,
( ~ sPE(multiplication(addition(sK2,c(sK2)),sK1),addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)))
| ~ sPE(addition(multiplication(c(sK2),sK1),multiplication(sK2,sK1)),sK1)
| ~ leq(multiplication(addition(sK2,c(sK2)),sK1),addition(multiplication(c(sK2),sK1),multiplication(sK2,sK1)))
| leq(addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)),sK1) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g19,plain,
( ~ sPE(addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)),multiplication(addition(sK2,c(sK2)),sK1))
| ~ sPE(addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)),addition(multiplication(c(sK2),sK1),multiplication(sK2,sK1)))
| ~ leq(addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)),addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)))
| leq(multiplication(addition(sK2,c(sK2)),sK1),addition(multiplication(c(sK2),sK1),multiplication(sK2,sK1))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g20,plain,
( ~ sPE(addition(multiplication(c(sK2),sK1),multiplication(sK2,sK1)),multiplication(addition(c(sK2),sK2),sK1))
| ~ sPE(multiplication(addition(c(sK2),sK2),sK1),sK1)
| sPE(addition(multiplication(c(sK2),sK1),multiplication(sK2,sK1)),sK1) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g21,plain,
( ~ sPE(multiplication(addition(c(sK2),sK2),sK1),addition(multiplication(c(sK2),sK1),multiplication(sK2,sK1)))
| sPE(addition(multiplication(c(sK2),sK1),multiplication(sK2,sK1)),multiplication(addition(c(sK2),sK2),sK1)) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KLE021+2 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : satcop --statistics %s
% 0.12/0.34 % Computer : n028.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 16 12:57:26 EDT 2022
% 0.19/0.34 % CPUTime :
% 0.19/0.51 % symbols: 13
% 0.19/0.51 % clauses: 34
% 0.19/0.51 % start clauses: 2
% 0.19/0.51 % iterative deepening steps: 545
% 0.19/0.51 % maximum path limit: 4
% 0.19/0.51 % literal attempts: 101704
% 0.19/0.51 % depth failures: 66991
% 0.19/0.51 % regularity failures: 7663
% 0.19/0.51 % tautology failures: 4194
% 0.19/0.51 % reductions: 1646
% 0.19/0.51 % extensions: 99276
% 0.19/0.51 % SAT variables: 39870
% 0.19/0.51 % SAT clauses: 47128
% 0.19/0.51 % WalkSAT solutions: 47127
% 0.19/0.51 % CDCL solutions: 0
% 0.19/0.51 % SZS status Theorem for theBenchmark
% 0.19/0.51 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------