TSTP Solution File: KLE037+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : KLE037+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n015.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:24 EDT 2022
% Result : Theorem 5.60s 1.01s
% Output : Proof 5.60s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ leq(one,star(sK0)),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals)]) ).
cnf(g1,plain,
sPE(multiplication(one,one),one),
inference(ground_cnf,[],[file('Axioms/KLE002+0.ax',multiplicative_right_identity)]) ).
cnf(g2,plain,
sPE(star(sK0),star(sK0)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g3,plain,
leq(addition(one,multiplication(star(sK0),sK0)),star(sK0)),
inference(ground_cnf,[],[file('Axioms/KLE002+0.ax',star_unfold_left)]) ).
cnf(g4,plain,
sPE(addition(one,one),one),
inference(ground_cnf,[],[file('Axioms/KLE002+0.ax',additive_idempotence)]) ).
cnf(g5,plain,
sPE(one,one),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g6,plain,
( ~ sPE(addition(one,one),one)
| leq(one,one) ),
inference(ground_cnf,[],[file('Axioms/KLE002+0.ax',order)]) ).
cnf(g7,plain,
( ~ leq(addition(one,multiplication(star(sK0),sK0)),star(sK0))
| sPE(addition(addition(one,multiplication(star(sK0),sK0)),star(sK0)),star(sK0)) ),
inference(ground_cnf,[],[file('Axioms/KLE002+0.ax',order)]) ).
cnf(g8,plain,
( ~ sPE(multiplication(one,one),one)
| sPE(one,multiplication(one,one)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g9,plain,
sPE(multiplication(star(sK0),sK0),multiplication(star(sK0),sK0)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g10,plain,
( ~ sPE(multiplication(one,one),one)
| ~ sPE(addition(addition(one,multiplication(star(sK0),sK0)),star(sK0)),star(sK0))
| ~ leq(multiplication(one,one),addition(addition(one,multiplication(star(sK0),sK0)),star(sK0)))
| leq(one,star(sK0)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
( ~ sPE(addition(multiplication(one,one),addition(addition(one,multiplication(star(sK0),sK0)),star(sK0))),addition(addition(one,multiplication(star(sK0),sK0)),star(sK0)))
| leq(multiplication(one,one),addition(addition(one,multiplication(star(sK0),sK0)),star(sK0))) ),
inference(ground_cnf,[],[file('Axioms/KLE002+0.ax',order)]) ).
cnf(g12,plain,
( ~ leq(multiplication(one,one),one)
| sPE(addition(multiplication(one,one),one),one) ),
inference(ground_cnf,[],[file('Axioms/KLE002+0.ax',order)]) ).
cnf(g13,plain,
( ~ sPE(one,multiplication(one,one))
| ~ sPE(one,one)
| ~ leq(one,one)
| leq(multiplication(one,one),one) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g14,plain,
sPE(addition(multiplication(one,one),addition(addition(one,multiplication(star(sK0),sK0)),star(sK0))),addition(addition(multiplication(one,one),addition(one,multiplication(star(sK0),sK0))),star(sK0))),
inference(ground_cnf,[],[file('Axioms/KLE002+0.ax',additive_associativity)]) ).
cnf(g15,plain,
sPE(addition(multiplication(one,one),addition(one,multiplication(star(sK0),sK0))),addition(addition(multiplication(one,one),one),multiplication(star(sK0),sK0))),
inference(ground_cnf,[],[file('Axioms/KLE002+0.ax',additive_associativity)]) ).
cnf(g16,plain,
( ~ sPE(addition(multiplication(one,one),addition(addition(one,multiplication(star(sK0),sK0)),star(sK0))),addition(addition(addition(multiplication(one,one),one),multiplication(star(sK0),sK0)),star(sK0)))
| ~ sPE(addition(addition(addition(multiplication(one,one),one),multiplication(star(sK0),sK0)),star(sK0)),addition(addition(one,multiplication(star(sK0),sK0)),star(sK0)))
| sPE(addition(multiplication(one,one),addition(addition(one,multiplication(star(sK0),sK0)),star(sK0))),addition(addition(one,multiplication(star(sK0),sK0)),star(sK0))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g17,plain,
( ~ sPE(addition(multiplication(one,one),addition(addition(one,multiplication(star(sK0),sK0)),star(sK0))),addition(addition(multiplication(one,one),addition(one,multiplication(star(sK0),sK0))),star(sK0)))
| ~ sPE(addition(addition(multiplication(one,one),addition(one,multiplication(star(sK0),sK0))),star(sK0)),addition(addition(addition(multiplication(one,one),one),multiplication(star(sK0),sK0)),star(sK0)))
| sPE(addition(multiplication(one,one),addition(addition(one,multiplication(star(sK0),sK0)),star(sK0))),addition(addition(addition(multiplication(one,one),one),multiplication(star(sK0),sK0)),star(sK0))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g18,plain,
( ~ sPE(addition(multiplication(one,one),addition(one,multiplication(star(sK0),sK0))),addition(addition(multiplication(one,one),one),multiplication(star(sK0),sK0)))
| ~ sPE(star(sK0),star(sK0))
| sPE(addition(addition(multiplication(one,one),addition(one,multiplication(star(sK0),sK0))),star(sK0)),addition(addition(addition(multiplication(one,one),one),multiplication(star(sK0),sK0)),star(sK0))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g19,plain,
( ~ sPE(addition(addition(multiplication(one,one),one),multiplication(star(sK0),sK0)),addition(one,multiplication(star(sK0),sK0)))
| ~ sPE(star(sK0),star(sK0))
| sPE(addition(addition(addition(multiplication(one,one),one),multiplication(star(sK0),sK0)),star(sK0)),addition(addition(one,multiplication(star(sK0),sK0)),star(sK0))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g20,plain,
( ~ sPE(addition(multiplication(one,one),one),one)
| ~ sPE(multiplication(star(sK0),sK0),multiplication(star(sK0),sK0))
| sPE(addition(addition(multiplication(one,one),one),multiplication(star(sK0),sK0)),addition(one,multiplication(star(sK0),sK0))) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KLE037+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : satcop --statistics %s
% 0.12/0.32 % Computer : n015.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Thu Jun 16 09:36:26 EDT 2022
% 0.12/0.32 % CPUTime :
% 5.60/1.01 % symbols: 9
% 5.60/1.01 % clauses: 25
% 5.60/1.01 % start clauses: 1
% 5.60/1.01 % iterative deepening steps: 4930
% 5.60/1.01 % maximum path limit: 6
% 5.60/1.01 % literal attempts: 639925
% 5.60/1.01 % depth failures: 243329
% 5.60/1.01 % regularity failures: 74666
% 5.60/1.01 % tautology failures: 42260
% 5.60/1.01 % reductions: 0
% 5.60/1.01 % extensions: 635118
% 5.60/1.01 % SAT variables: 230102
% 5.60/1.01 % SAT clauses: 341714
% 5.60/1.01 % WalkSAT solutions: 341713
% 5.60/1.01 % CDCL solutions: 0
% 5.60/1.01 % SZS status Theorem for theBenchmark
% 5.60/1.01 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------