TSTP Solution File: KLE007+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : KLE007+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n026.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:10 EDT 2022
% Result : Theorem 0.22s 0.48s
% Output : Proof 0.22s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
test(sK2),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals)]) ).
cnf(g1,plain,
test(sK1),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals)]) ).
cnf(g2,plain,
~ sPE(one,addition(multiplication(addition(sK1,c(sK1)),sK2),multiplication(addition(sK1,c(sK1)),c(sK2)))),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals)]) ).
cnf(g3,plain,
( ~ sPE(addition(multiplication(addition(sK1,c(sK1)),sK2),multiplication(addition(sK1,c(sK1)),c(sK2))),one)
| sPE(one,addition(multiplication(addition(sK1,c(sK1)),sK2),multiplication(addition(sK1,c(sK1)),c(sK2)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
( ~ sPE(c(sK2),c(sK2))
| ~ test(sK2)
| complement(sK2,c(sK2)) ),
inference(ground_cnf,[],[file('Axioms/KLE001+1.ax',test_3)]) ).
cnf(g5,plain,
sPE(c(sK2),c(sK2)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g6,plain,
( ~ complement(sK2,c(sK2))
| sPE(addition(c(sK2),sK2),one) ),
inference(ground_cnf,[],[file('Axioms/KLE001+1.ax',test_2)]) ).
cnf(g7,plain,
( ~ sPE(c(sK1),c(sK1))
| ~ test(sK1)
| complement(sK1,c(sK1)) ),
inference(ground_cnf,[],[file('Axioms/KLE001+1.ax',test_3)]) ).
cnf(g8,plain,
sPE(c(sK1),c(sK1)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g9,plain,
( ~ complement(sK1,c(sK1))
| sPE(addition(c(sK1),sK1),one) ),
inference(ground_cnf,[],[file('Axioms/KLE001+1.ax',test_2)]) ).
cnf(g10,plain,
( ~ sPE(addition(c(sK2),sK2),one)
| sPE(one,addition(c(sK2),sK2)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
( ~ sPE(addition(multiplication(addition(sK1,c(sK1)),sK2),multiplication(addition(sK1,c(sK1)),c(sK2))),addition(multiplication(addition(sK1,c(sK1)),c(sK2)),multiplication(addition(sK1,c(sK1)),sK2)))
| ~ sPE(addition(multiplication(addition(sK1,c(sK1)),c(sK2)),multiplication(addition(sK1,c(sK1)),sK2)),one)
| sPE(addition(multiplication(addition(sK1,c(sK1)),sK2),multiplication(addition(sK1,c(sK1)),c(sK2))),one) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
sPE(addition(multiplication(addition(sK1,c(sK1)),sK2),multiplication(addition(sK1,c(sK1)),c(sK2))),addition(multiplication(addition(sK1,c(sK1)),c(sK2)),multiplication(addition(sK1,c(sK1)),sK2))),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',additive_commutativity)]) ).
cnf(g13,plain,
sPE(multiplication(one,one),one),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',multiplicative_right_identity)]) ).
cnf(g14,plain,
sPE(multiplication(addition(sK1,c(sK1)),addition(c(sK2),sK2)),addition(multiplication(addition(sK1,c(sK1)),c(sK2)),multiplication(addition(sK1,c(sK1)),sK2))),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',right_distributivity)]) ).
cnf(g15,plain,
( ~ sPE(multiplication(one,one),addition(multiplication(addition(sK1,c(sK1)),c(sK2)),multiplication(addition(sK1,c(sK1)),sK2)))
| sPE(addition(multiplication(addition(sK1,c(sK1)),c(sK2)),multiplication(addition(sK1,c(sK1)),sK2)),multiplication(one,one)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g16,plain,
( ~ sPE(multiplication(one,one),multiplication(addition(sK1,c(sK1)),addition(c(sK2),sK2)))
| ~ sPE(multiplication(addition(sK1,c(sK1)),addition(c(sK2),sK2)),addition(multiplication(addition(sK1,c(sK1)),c(sK2)),multiplication(addition(sK1,c(sK1)),sK2)))
| sPE(multiplication(one,one),addition(multiplication(addition(sK1,c(sK1)),c(sK2)),multiplication(addition(sK1,c(sK1)),sK2))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g17,plain,
( ~ sPE(one,addition(sK1,c(sK1)))
| ~ sPE(one,addition(c(sK2),sK2))
| sPE(multiplication(one,one),multiplication(addition(sK1,c(sK1)),addition(c(sK2),sK2))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g18,plain,
( ~ sPE(addition(multiplication(addition(sK1,c(sK1)),c(sK2)),multiplication(addition(sK1,c(sK1)),sK2)),multiplication(one,one))
| ~ sPE(multiplication(one,one),one)
| sPE(addition(multiplication(addition(sK1,c(sK1)),c(sK2)),multiplication(addition(sK1,c(sK1)),sK2)),one) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g19,plain,
( ~ sPE(addition(sK1,c(sK1)),addition(c(sK1),sK1))
| ~ sPE(addition(c(sK1),sK1),one)
| sPE(addition(sK1,c(sK1)),one) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g20,plain,
sPE(addition(sK1,c(sK1)),addition(c(sK1),sK1)),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',additive_commutativity)]) ).
cnf(g21,plain,
( ~ sPE(addition(sK1,c(sK1)),one)
| sPE(one,addition(sK1,c(sK1))) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : KLE007+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.15 % Command : satcop --statistics %s
% 0.15/0.37 % Computer : n026.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 600
% 0.15/0.37 % DateTime : Thu Jun 16 09:25:53 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.22/0.48 % symbols: 13
% 0.22/0.48 % clauses: 35
% 0.22/0.48 % start clauses: 3
% 0.22/0.48 % iterative deepening steps: 312
% 0.22/0.48 % maximum path limit: 4
% 0.22/0.48 % literal attempts: 91247
% 0.22/0.48 % depth failures: 66361
% 0.22/0.48 % regularity failures: 6060
% 0.22/0.48 % tautology failures: 4924
% 0.22/0.48 % reductions: 691
% 0.22/0.48 % extensions: 89944
% 0.22/0.48 % SAT variables: 18152
% 0.22/0.48 % SAT clauses: 20657
% 0.22/0.48 % WalkSAT solutions: 20651
% 0.22/0.48 % CDCL solutions: 0
% 0.22/0.48 % SZS status Theorem for theBenchmark
% 0.22/0.48 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------