TSTP Solution File: KLE089+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : KLE089+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n012.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:37 EDT 2022
% Result : Theorem 8.40s 1.51s
% Output : Proof 8.40s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ sPE(multiplication(domain(sK0),sK1),zero),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals)]) ).
cnf(g1,plain,
sPE(addition(domain(sK0),antidomain(sK1)),antidomain(sK1)),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals)]) ).
cnf(g2,plain,
( ~ sPE(zero,multiplication(domain(sK0),sK1))
| sPE(multiplication(domain(sK0),sK1),zero) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g3,plain,
( ~ sPE(addition(domain(sK0),antidomain(sK1)),antidomain(sK1))
| sPE(antidomain(sK1),addition(domain(sK0),antidomain(sK1))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
( ~ sPE(antidomain(sK1),addition(domain(sK0),antidomain(sK1)))
| ~ sPE(sK1,sK1)
| sPE(multiplication(antidomain(sK1),sK1),multiplication(addition(domain(sK0),antidomain(sK1)),sK1)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g5,plain,
sPE(addition(zero,zero),zero),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',additive_identity)]) ).
cnf(g6,plain,
sPE(multiplication(antidomain(sK1),sK1),zero),
inference(ground_cnf,[],[file('Axioms/KLE001+4.ax',domain1)]) ).
cnf(g7,plain,
sPE(sK1,sK1),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
sPE(addition(multiplication(domain(sK0),sK1),zero),multiplication(domain(sK0),sK1)),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',additive_identity)]) ).
cnf(g9,plain,
sPE(multiplication(multiplication(domain(sK0),sK1),one),multiplication(domain(sK0),sK1)),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',multiplicative_right_identity)]) ).
cnf(g10,plain,
( ~ sPE(addition(multiplication(domain(sK0),sK1),zero),multiplication(domain(sK0),sK1))
| sPE(multiplication(domain(sK0),sK1),addition(multiplication(domain(sK0),sK1),zero)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
( ~ leq(multiplication(domain(sK0),sK1),zero)
| sPE(addition(multiplication(domain(sK0),sK1),zero),zero) ),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',order)]) ).
cnf(g12,plain,
( ~ sPE(addition(zero,zero),zero)
| sPE(zero,addition(zero,zero)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g13,plain,
sPE(multiplication(domain(sK0),sK1),multiplication(domain(sK0),sK1)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g14,plain,
sPE(addition(addition(multiplication(domain(sK0),sK1),zero),addition(multiplication(domain(sK0),sK1),zero)),addition(multiplication(domain(sK0),sK1),zero)),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',additive_idempotence)]) ).
cnf(g15,plain,
( ~ sPE(zero,addition(zero,zero))
| ~ sPE(addition(zero,zero),multiplication(domain(sK0),sK1))
| sPE(zero,multiplication(domain(sK0),sK1)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g16,plain,
( ~ sPE(addition(zero,zero),multiplication(multiplication(domain(sK0),sK1),one))
| ~ sPE(multiplication(multiplication(domain(sK0),sK1),one),multiplication(domain(sK0),sK1))
| sPE(addition(zero,zero),multiplication(domain(sK0),sK1)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g17,plain,
( ~ sPE(multiplication(multiplication(domain(sK0),sK1),one),addition(zero,zero))
| sPE(addition(zero,zero),multiplication(multiplication(domain(sK0),sK1),one)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g18,plain,
( ~ sPE(multiplication(antidomain(sK1),sK1),multiplication(addition(domain(sK0),antidomain(sK1)),sK1))
| ~ sPE(multiplication(addition(domain(sK0),antidomain(sK1)),sK1),addition(multiplication(domain(sK0),sK1),multiplication(antidomain(sK1),sK1)))
| sPE(multiplication(antidomain(sK1),sK1),addition(multiplication(domain(sK0),sK1),multiplication(antidomain(sK1),sK1))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g19,plain,
sPE(multiplication(addition(domain(sK0),antidomain(sK1)),sK1),addition(multiplication(domain(sK0),sK1),multiplication(antidomain(sK1),sK1))),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',left_distributivity)]) ).
cnf(g20,plain,
( ~ sPE(multiplication(antidomain(sK1),sK1),addition(multiplication(domain(sK0),sK1),multiplication(antidomain(sK1),sK1)))
| sPE(addition(multiplication(domain(sK0),sK1),multiplication(antidomain(sK1),sK1)),multiplication(antidomain(sK1),sK1)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g21,plain,
( ~ sPE(multiplication(multiplication(domain(sK0),sK1),one),multiplication(domain(sK0),sK1))
| ~ sPE(multiplication(domain(sK0),sK1),addition(zero,zero))
| sPE(multiplication(multiplication(domain(sK0),sK1),one),addition(zero,zero)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g22,plain,
( ~ sPE(multiplication(domain(sK0),sK1),addition(multiplication(domain(sK0),sK1),zero))
| ~ sPE(addition(multiplication(domain(sK0),sK1),zero),addition(zero,zero))
| sPE(multiplication(domain(sK0),sK1),addition(zero,zero)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g23,plain,
( ~ sPE(addition(zero,zero),addition(multiplication(domain(sK0),sK1),zero))
| sPE(addition(multiplication(domain(sK0),sK1),zero),addition(zero,zero)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g24,plain,
( ~ sPE(addition(zero,zero),addition(addition(multiplication(domain(sK0),sK1),zero),addition(multiplication(domain(sK0),sK1),zero)))
| ~ sPE(addition(addition(multiplication(domain(sK0),sK1),zero),addition(multiplication(domain(sK0),sK1),zero)),addition(multiplication(domain(sK0),sK1),zero))
| sPE(addition(zero,zero),addition(multiplication(domain(sK0),sK1),zero)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g25,plain,
( ~ sPE(addition(addition(multiplication(domain(sK0),sK1),zero),addition(multiplication(domain(sK0),sK1),zero)),addition(zero,zero))
| sPE(addition(zero,zero),addition(addition(multiplication(domain(sK0),sK1),zero),addition(multiplication(domain(sK0),sK1),zero))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g26,plain,
( ~ sPE(addition(multiplication(domain(sK0),sK1),zero),zero)
| ~ sPE(addition(multiplication(domain(sK0),sK1),zero),zero)
| sPE(addition(addition(multiplication(domain(sK0),sK1),zero),addition(multiplication(domain(sK0),sK1),zero)),addition(zero,zero)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g27,plain,
( ~ sPE(multiplication(domain(sK0),sK1),multiplication(domain(sK0),sK1))
| ~ sPE(multiplication(antidomain(sK1),sK1),zero)
| ~ leq(multiplication(domain(sK0),sK1),multiplication(antidomain(sK1),sK1))
| leq(multiplication(domain(sK0),sK1),zero) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g28,plain,
( ~ sPE(addition(multiplication(domain(sK0),sK1),multiplication(antidomain(sK1),sK1)),multiplication(antidomain(sK1),sK1))
| leq(multiplication(domain(sK0),sK1),multiplication(antidomain(sK1),sK1)) ),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',order)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KLE089+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : satcop --statistics %s
% 0.12/0.33 % Computer : n012.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 16 10:02:24 EDT 2022
% 0.12/0.33 % CPUTime :
% 8.40/1.51 % symbols: 13
% 8.40/1.51 % clauses: 33
% 8.40/1.51 % start clauses: 2
% 8.40/1.51 % iterative deepening steps: 5713
% 8.40/1.51 % maximum path limit: 7
% 8.40/1.51 % literal attempts: 957193
% 8.40/1.51 % depth failures: 536240
% 8.40/1.51 % regularity failures: 59420
% 8.40/1.51 % tautology failures: 49154
% 8.40/1.51 % reductions: 38550
% 8.40/1.51 % extensions: 915452
% 8.40/1.51 % SAT variables: 545965
% 8.40/1.51 % SAT clauses: 644160
% 8.40/1.51 % WalkSAT solutions: 644160
% 8.40/1.51 % CDCL solutions: 0
% 8.40/1.51 % SZS status Theorem for theBenchmark
% 8.40/1.51 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------