TSTP Solution File: KLE007+2 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : KLE007+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n014.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:11 EDT 2022
% Result : Theorem 0.20s 0.50s
% Output : Proof 0.20s
% 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,
test(sK1),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals)]) ).
cnf(g2,plain,
( ~ leq(addition(multiplication(addition(sK1,c(sK1)),sK2),multiplication(addition(sK1,c(sK1)),c(sK2))),one)
| ~ leq(one,addition(multiplication(addition(sK1,c(sK1)),sK2),multiplication(addition(sK1,c(sK1)),c(sK2)))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals)]) ).
cnf(g3,plain,
( ~ sPE(c(sK2),c(sK2))
| ~ test(sK2)
| complement(sK2,c(sK2)) ),
inference(ground_cnf,[],[file('Axioms/KLE001+1.ax',test_3)]) ).
cnf(g4,plain,
sPE(c(sK2),c(sK2)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g5,plain,
( ~ complement(sK2,c(sK2))
| sPE(addition(c(sK2),sK2),one) ),
inference(ground_cnf,[],[file('Axioms/KLE001+1.ax',test_2)]) ).
cnf(g6,plain,
( ~ sPE(c(sK1),c(sK1))
| ~ test(sK1)
| complement(sK1,c(sK1)) ),
inference(ground_cnf,[],[file('Axioms/KLE001+1.ax',test_3)]) ).
cnf(g7,plain,
sPE(c(sK1),c(sK1)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
( ~ complement(sK1,c(sK1))
| sPE(addition(c(sK1),sK1),one) ),
inference(ground_cnf,[],[file('Axioms/KLE001+1.ax',test_2)]) ).
cnf(g9,plain,
sPE(multiplication(one,one),one),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',multiplicative_right_identity)]) ).
cnf(g10,plain,
sPE(multiplication(addition(sK1,c(sK1)),addition(sK2,c(sK2))),addition(multiplication(addition(sK1,c(sK1)),sK2),multiplication(addition(sK1,c(sK1)),c(sK2)))),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',right_distributivity)]) ).
cnf(g11,plain,
( ~ sPE(multiplication(addition(sK1,c(sK1)),addition(sK2,c(sK2))),one)
| ~ sPE(multiplication(addition(sK1,c(sK1)),addition(sK2,c(sK2))),addition(multiplication(addition(sK1,c(sK1)),sK2),multiplication(addition(sK1,c(sK1)),c(sK2))))
| ~ leq(multiplication(addition(sK1,c(sK1)),addition(sK2,c(sK2))),multiplication(addition(sK1,c(sK1)),addition(sK2,c(sK2))))
| leq(one,addition(multiplication(addition(sK1,c(sK1)),sK2),multiplication(addition(sK1,c(sK1)),c(sK2)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
( ~ sPE(addition(multiplication(addition(sK1,c(sK1)),addition(sK2,c(sK2))),multiplication(addition(sK1,c(sK1)),addition(sK2,c(sK2)))),multiplication(addition(sK1,c(sK1)),addition(sK2,c(sK2))))
| leq(multiplication(addition(sK1,c(sK1)),addition(sK2,c(sK2))),multiplication(addition(sK1,c(sK1)),addition(sK2,c(sK2)))) ),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',order)]) ).
cnf(g13,plain,
sPE(addition(multiplication(addition(sK1,c(sK1)),addition(sK2,c(sK2))),multiplication(addition(sK1,c(sK1)),addition(sK2,c(sK2)))),multiplication(addition(sK1,c(sK1)),addition(sK2,c(sK2)))),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',additive_idempotence)]) ).
cnf(g14,plain,
( ~ sPE(multiplication(addition(sK1,c(sK1)),addition(sK2,c(sK2))),addition(multiplication(addition(sK1,c(sK1)),sK2),multiplication(addition(sK1,c(sK1)),c(sK2))))
| ~ sPE(multiplication(addition(sK1,c(sK1)),addition(sK2,c(sK2))),one)
| ~ leq(multiplication(addition(sK1,c(sK1)),addition(sK2,c(sK2))),multiplication(addition(sK1,c(sK1)),addition(sK2,c(sK2))))
| leq(addition(multiplication(addition(sK1,c(sK1)),sK2),multiplication(addition(sK1,c(sK1)),c(sK2))),one) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g15,plain,
sPE(addition(sK2,c(sK2)),addition(c(sK2),sK2)),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',additive_commutativity)]) ).
cnf(g16,plain,
( ~ sPE(multiplication(addition(sK1,c(sK1)),addition(sK2,c(sK2))),multiplication(addition(c(sK1),sK1),addition(c(sK2),sK2)))
| ~ sPE(multiplication(addition(c(sK1),sK1),addition(c(sK2),sK2)),one)
| sPE(multiplication(addition(sK1,c(sK1)),addition(sK2,c(sK2))),one) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g17,plain,
( ~ sPE(addition(sK1,c(sK1)),addition(c(sK1),sK1))
| ~ sPE(addition(sK2,c(sK2)),addition(c(sK2),sK2))
| sPE(multiplication(addition(sK1,c(sK1)),addition(sK2,c(sK2))),multiplication(addition(c(sK1),sK1),addition(c(sK2),sK2))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g18,plain,
sPE(addition(sK1,c(sK1)),addition(c(sK1),sK1)),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',additive_commutativity)]) ).
cnf(g19,plain,
( ~ sPE(multiplication(addition(c(sK1),sK1),addition(c(sK2),sK2)),multiplication(one,one))
| ~ sPE(multiplication(one,one),one)
| sPE(multiplication(addition(c(sK1),sK1),addition(c(sK2),sK2)),one) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g20,plain,
( ~ sPE(addition(c(sK1),sK1),one)
| ~ sPE(addition(c(sK2),sK2),one)
| sPE(multiplication(addition(c(sK1),sK1),addition(c(sK2),sK2)),multiplication(one,one)) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : KLE007+2 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.13 % Command : satcop --statistics %s
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 16 13:33:20 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.50 % symbols: 13
% 0.20/0.50 % clauses: 35
% 0.20/0.50 % start clauses: 3
% 0.20/0.50 % iterative deepening steps: 823
% 0.20/0.50 % maximum path limit: 4
% 0.20/0.50 % literal attempts: 268159
% 0.20/0.50 % depth failures: 193769
% 0.20/0.50 % regularity failures: 18365
% 0.20/0.50 % tautology failures: 13728
% 0.20/0.50 % reductions: 1327
% 0.20/0.50 % extensions: 265252
% 0.20/0.50 % SAT variables: 36062
% 0.20/0.50 % SAT clauses: 43737
% 0.20/0.50 % WalkSAT solutions: 43735
% 0.20/0.50 % CDCL solutions: 0
% 0.20/0.50 % SZS status Theorem for theBenchmark
% 0.20/0.50 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------