TSTP Solution File: KLE129+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : KLE129+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n011.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:46 EDT 2022
% Result : Theorem 2.24s 0.78s
% Output : Proof 2.24s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ sPE(divergence(sK0),zero),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals)]) ).
cnf(g1,plain,
( ~ sPE(zero,divergence(sK0))
| sPE(divergence(sK0),zero) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g2,plain,
sPE(forward_diamond(sK0,divergence(sK0)),divergence(sK0)),
inference(ground_cnf,[],[file('Axioms/KLE001+7.ax',divergence1)]) ).
cnf(g3,plain,
( ~ sPE(forward_diamond(sK0,divergence(sK0)),zero)
| sPE(zero,forward_diamond(sK0,divergence(sK0))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
( ~ sPE(zero,forward_diamond(sK0,divergence(sK0)))
| ~ sPE(forward_diamond(sK0,divergence(sK0)),divergence(sK0))
| sPE(zero,divergence(sK0)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g5,plain,
sPE(sK0,sK0),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g6,plain,
( ~ sPE(addition(domain(multiplication(sK0,domain(divergence(sK0)))),forward_diamond(sK0,domain(multiplication(sK0,domain(divergence(sK0)))))),forward_diamond(sK0,domain(multiplication(sK0,domain(divergence(sK0))))))
| sPE(domain(multiplication(sK0,domain(divergence(sK0)))),zero) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals)]) ).
cnf(g7,plain,
( ~ leq(domain(multiplication(sK0,domain(divergence(sK0)))),forward_diamond(sK0,domain(multiplication(sK0,domain(divergence(sK0))))))
| sPE(addition(domain(multiplication(sK0,domain(divergence(sK0)))),forward_diamond(sK0,domain(multiplication(sK0,domain(divergence(sK0)))))),forward_diamond(sK0,domain(multiplication(sK0,domain(divergence(sK0)))))) ),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',order)]) ).
cnf(g8,plain,
sPE(forward_diamond(sK0,divergence(sK0)),domain(multiplication(sK0,domain(divergence(sK0))))),
inference(ground_cnf,[],[file('Axioms/KLE001+6.ax',forward_diamond)]) ).
cnf(g9,plain,
( ~ sPE(forward_diamond(sK0,divergence(sK0)),domain(multiplication(sK0,domain(divergence(sK0)))))
| ~ sPE(domain(multiplication(sK0,domain(divergence(sK0)))),zero)
| sPE(forward_diamond(sK0,divergence(sK0)),zero) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g10,plain,
( ~ sPE(forward_diamond(sK0,divergence(sK0)),domain(multiplication(sK0,domain(divergence(sK0)))))
| ~ sPE(forward_diamond(sK0,domain(multiplication(sK0,domain(divergence(sK0))))),forward_diamond(sK0,domain(multiplication(sK0,domain(divergence(sK0))))))
| ~ leq(forward_diamond(sK0,divergence(sK0)),forward_diamond(sK0,domain(multiplication(sK0,domain(divergence(sK0))))))
| leq(domain(multiplication(sK0,domain(divergence(sK0)))),forward_diamond(sK0,domain(multiplication(sK0,domain(divergence(sK0)))))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
sPE(forward_diamond(sK0,domain(multiplication(sK0,domain(divergence(sK0))))),forward_diamond(sK0,domain(multiplication(sK0,domain(divergence(sK0)))))),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
( ~ sPE(forward_diamond(sK0,forward_diamond(sK0,divergence(sK0))),forward_diamond(sK0,divergence(sK0)))
| ~ sPE(forward_diamond(sK0,forward_diamond(sK0,divergence(sK0))),forward_diamond(sK0,domain(multiplication(sK0,domain(divergence(sK0))))))
| ~ leq(forward_diamond(sK0,forward_diamond(sK0,divergence(sK0))),forward_diamond(sK0,forward_diamond(sK0,divergence(sK0))))
| leq(forward_diamond(sK0,divergence(sK0)),forward_diamond(sK0,domain(multiplication(sK0,domain(divergence(sK0)))))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g13,plain,
( ~ sPE(sK0,sK0)
| ~ sPE(forward_diamond(sK0,divergence(sK0)),domain(multiplication(sK0,domain(divergence(sK0)))))
| sPE(forward_diamond(sK0,forward_diamond(sK0,divergence(sK0))),forward_diamond(sK0,domain(multiplication(sK0,domain(divergence(sK0)))))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g14,plain,
( ~ sPE(addition(forward_diamond(sK0,forward_diamond(sK0,divergence(sK0))),forward_diamond(sK0,forward_diamond(sK0,divergence(sK0)))),forward_diamond(sK0,forward_diamond(sK0,divergence(sK0))))
| leq(forward_diamond(sK0,forward_diamond(sK0,divergence(sK0))),forward_diamond(sK0,forward_diamond(sK0,divergence(sK0)))) ),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',order)]) ).
cnf(g15,plain,
sPE(addition(forward_diamond(sK0,forward_diamond(sK0,divergence(sK0))),forward_diamond(sK0,forward_diamond(sK0,divergence(sK0)))),forward_diamond(sK0,forward_diamond(sK0,divergence(sK0)))),
inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',additive_idempotence)]) ).
cnf(g16,plain,
( ~ sPE(sK0,sK0)
| ~ sPE(forward_diamond(sK0,divergence(sK0)),divergence(sK0))
| sPE(forward_diamond(sK0,forward_diamond(sK0,divergence(sK0))),forward_diamond(sK0,divergence(sK0))) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KLE129+1 : TPTP v8.1.0. Released v4.0.0.
% 0.13/0.13 % Command : satcop --statistics %s
% 0.13/0.34 % Computer : n011.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.19/0.34 % DateTime : Thu Jun 16 09:38:06 EDT 2022
% 0.19/0.35 % CPUTime :
% 2.24/0.78 % symbols: 20
% 2.24/0.78 % clauses: 49
% 2.24/0.78 % start clauses: 2
% 2.24/0.78 % iterative deepening steps: 2332
% 2.24/0.78 % maximum path limit: 5
% 2.24/0.78 % literal attempts: 274828
% 2.24/0.78 % depth failures: 100105
% 2.24/0.78 % regularity failures: 34262
% 2.24/0.78 % tautology failures: 17843
% 2.24/0.78 % reductions: 352
% 2.24/0.78 % extensions: 270067
% 2.24/0.78 % SAT variables: 73821
% 2.24/0.78 % SAT clauses: 111553
% 2.24/0.78 % WalkSAT solutions: 111550
% 2.24/0.78 % CDCL solutions: 0
% 2.24/0.78 % SZS status Theorem for theBenchmark
% 2.24/0.78 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------