TSTP Solution File: LCL186-10 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL186-10 : TPTP v8.1.0. Released v7.5.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 14:13:26 EDT 2022
% Result : Unsatisfiable 13.13s 1.94s
% Output : Proof 13.13s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ sPE(theorem(or(not(not(p)),or(not(p),q))),true),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this)]) ).
cnf(g1,plain,
sPE(axiom(or(not(or(p,or(p,p))),or(p,or(p,p)))),true),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_5)]) ).
cnf(g2,plain,
sPE(true,true),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g3,plain,
sPE(theorem(or(not(not(p)),or(not(p),q))),theorem(or(not(not(p)),or(not(p),q)))),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
( ~ sPE(ifeq(true,true,theorem(or(not(not(p)),or(not(p),q))),true),theorem(or(not(not(p)),or(not(p),q))))
| sPE(theorem(or(not(not(p)),or(not(p),q))),ifeq(true,true,theorem(or(not(not(p)),or(not(p),q))),true)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g5,plain,
sPE(ifeq(true,true,theorem(or(not(not(p)),or(not(p),q))),true),theorem(or(not(not(p)),or(not(p),q)))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom)]) ).
cnf(g6,plain,
sPE(ifeq(axiom(or(not(or(q,not(p))),or(not(p),q))),true,theorem(or(not(or(q,not(p))),or(not(p),q))),true),true),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1)]) ).
cnf(g7,plain,
sPE(axiom(or(not(or(q,not(p))),or(not(p),q))),true),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_4)]) ).
cnf(g8,plain,
( ~ sPE(theorem(or(not(not(p)),or(not(p),q))),ifeq(theorem(or(not(or(q,not(p))),or(not(p),q))),true,ifeq(axiom(or(not(not(p)),or(q,not(p)))),true,theorem(or(not(not(p)),or(not(p),q))),true),true))
| ~ sPE(ifeq(theorem(or(not(or(q,not(p))),or(not(p),q))),true,ifeq(axiom(or(not(not(p)),or(q,not(p)))),true,theorem(or(not(not(p)),or(not(p),q))),true),true),true)
| sPE(theorem(or(not(not(p)),or(not(p),q))),true) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g9,plain,
sPE(ifeq(theorem(or(not(or(q,not(p))),or(not(p),q))),true,ifeq(axiom(or(not(not(p)),or(q,not(p)))),true,theorem(or(not(not(p)),or(not(p),q))),true),true),true),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_3)]) ).
cnf(g10,plain,
( ~ sPE(ifeq(theorem(or(not(or(q,not(p))),or(not(p),q))),true,ifeq(axiom(or(not(not(p)),or(q,not(p)))),true,theorem(or(not(not(p)),or(not(p),q))),true),true),theorem(or(not(not(p)),or(not(p),q))))
| sPE(theorem(or(not(not(p)),or(not(p),q))),ifeq(theorem(or(not(or(q,not(p))),or(not(p),q))),true,ifeq(axiom(or(not(not(p)),or(q,not(p)))),true,theorem(or(not(not(p)),or(not(p),q))),true),true)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
( ~ sPE(ifeq(theorem(or(not(or(q,not(p))),or(not(p),q))),true,ifeq(axiom(or(not(not(p)),or(q,not(p)))),true,theorem(or(not(not(p)),or(not(p),q))),true),true),ifeq(ifeq(true,true,theorem(or(not(or(q,not(p))),or(not(p),q))),true),ifeq(true,true,theorem(or(not(or(q,not(p))),or(not(p),q))),true),theorem(or(not(not(p)),or(not(p),q))),axiom(or(not(or(p,or(p,p))),or(p,or(p,p))))))
| ~ sPE(ifeq(ifeq(true,true,theorem(or(not(or(q,not(p))),or(not(p),q))),true),ifeq(true,true,theorem(or(not(or(q,not(p))),or(not(p),q))),true),theorem(or(not(not(p)),or(not(p),q))),axiom(or(not(or(p,or(p,p))),or(p,or(p,p))))),theorem(or(not(not(p)),or(not(p),q))))
| sPE(ifeq(theorem(or(not(or(q,not(p))),or(not(p),q))),true,ifeq(axiom(or(not(not(p)),or(q,not(p)))),true,theorem(or(not(not(p)),or(not(p),q))),true),true),theorem(or(not(not(p)),or(not(p),q)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
sPE(ifeq(ifeq(true,true,theorem(or(not(or(q,not(p))),or(not(p),q))),true),ifeq(true,true,theorem(or(not(or(q,not(p))),or(not(p),q))),true),theorem(or(not(not(p)),or(not(p),q))),axiom(or(not(or(p,or(p,p))),or(p,or(p,p))))),theorem(or(not(not(p)),or(not(p),q)))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom)]) ).
cnf(g13,plain,
( ~ sPE(ifeq(ifeq(true,true,theorem(or(not(or(q,not(p))),or(not(p),q))),true),ifeq(true,true,theorem(or(not(or(q,not(p))),or(not(p),q))),true),theorem(or(not(not(p)),or(not(p),q))),axiom(or(not(or(p,or(p,p))),or(p,or(p,p))))),ifeq(theorem(or(not(or(q,not(p))),or(not(p),q))),true,ifeq(axiom(or(not(not(p)),or(q,not(p)))),true,theorem(or(not(not(p)),or(not(p),q))),true),true))
| sPE(ifeq(theorem(or(not(or(q,not(p))),or(not(p),q))),true,ifeq(axiom(or(not(not(p)),or(q,not(p)))),true,theorem(or(not(not(p)),or(not(p),q))),true),true),ifeq(ifeq(true,true,theorem(or(not(or(q,not(p))),or(not(p),q))),true),ifeq(true,true,theorem(or(not(or(q,not(p))),or(not(p),q))),true),theorem(or(not(not(p)),or(not(p),q))),axiom(or(not(or(p,or(p,p))),or(p,or(p,p)))))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g14,plain,
( ~ sPE(ifeq(true,true,theorem(or(not(or(q,not(p))),or(not(p),q))),true),theorem(or(not(or(q,not(p))),or(not(p),q))))
| ~ sPE(ifeq(true,true,theorem(or(not(or(q,not(p))),or(not(p),q))),true),true)
| ~ sPE(theorem(or(not(not(p)),or(not(p),q))),ifeq(axiom(or(not(not(p)),or(q,not(p)))),true,theorem(or(not(not(p)),or(not(p),q))),true))
| ~ sPE(axiom(or(not(or(p,or(p,p))),or(p,or(p,p)))),true)
| sPE(ifeq(ifeq(true,true,theorem(or(not(or(q,not(p))),or(not(p),q))),true),ifeq(true,true,theorem(or(not(or(q,not(p))),or(not(p),q))),true),theorem(or(not(not(p)),or(not(p),q))),axiom(or(not(or(p,or(p,p))),or(p,or(p,p))))),ifeq(theorem(or(not(or(q,not(p))),or(not(p),q))),true,ifeq(axiom(or(not(not(p)),or(q,not(p)))),true,theorem(or(not(not(p)),or(not(p),q))),true),true)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g15,plain,
( ~ sPE(theorem(or(not(not(p)),or(not(p),q))),ifeq(true,true,theorem(or(not(not(p)),or(not(p),q))),true))
| ~ sPE(ifeq(true,true,theorem(or(not(not(p)),or(not(p),q))),true),ifeq(axiom(or(not(not(p)),or(q,not(p)))),true,theorem(or(not(not(p)),or(not(p),q))),true))
| sPE(theorem(or(not(not(p)),or(not(p),q))),ifeq(axiom(or(not(not(p)),or(q,not(p)))),true,theorem(or(not(not(p)),or(not(p),q))),true)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g16,plain,
( ~ sPE(ifeq(axiom(or(not(not(p)),or(q,not(p)))),true,theorem(or(not(not(p)),or(not(p),q))),true),ifeq(true,true,theorem(or(not(not(p)),or(not(p),q))),true))
| sPE(ifeq(true,true,theorem(or(not(not(p)),or(not(p),q))),true),ifeq(axiom(or(not(not(p)),or(q,not(p)))),true,theorem(or(not(not(p)),or(not(p),q))),true)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g17,plain,
( ~ sPE(axiom(or(not(not(p)),or(q,not(p)))),true)
| ~ sPE(true,true)
| ~ sPE(theorem(or(not(not(p)),or(not(p),q))),theorem(or(not(not(p)),or(not(p),q))))
| ~ sPE(true,true)
| sPE(ifeq(axiom(or(not(not(p)),or(q,not(p)))),true,theorem(or(not(not(p)),or(not(p),q))),true),ifeq(true,true,theorem(or(not(not(p)),or(not(p),q))),true)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g18,plain,
sPE(axiom(or(not(not(p)),or(q,not(p)))),true),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_3)]) ).
cnf(g19,plain,
sPE(ifeq(true,true,theorem(or(not(or(q,not(p))),or(not(p),q))),true),theorem(or(not(or(q,not(p))),or(not(p),q)))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom)]) ).
cnf(g20,plain,
( ~ sPE(ifeq(true,true,theorem(or(not(or(q,not(p))),or(not(p),q))),true),ifeq(axiom(or(not(or(q,not(p))),or(not(p),q))),true,theorem(or(not(or(q,not(p))),or(not(p),q))),true))
| ~ sPE(ifeq(axiom(or(not(or(q,not(p))),or(not(p),q))),true,theorem(or(not(or(q,not(p))),or(not(p),q))),true),true)
| sPE(ifeq(true,true,theorem(or(not(or(q,not(p))),or(not(p),q))),true),true) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g21,plain,
( ~ sPE(ifeq(axiom(or(not(or(q,not(p))),or(not(p),q))),true,theorem(or(not(or(q,not(p))),or(not(p),q))),true),ifeq(true,true,theorem(or(not(or(q,not(p))),or(not(p),q))),true))
| sPE(ifeq(true,true,theorem(or(not(or(q,not(p))),or(not(p),q))),true),ifeq(axiom(or(not(or(q,not(p))),or(not(p),q))),true,theorem(or(not(or(q,not(p))),or(not(p),q))),true)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g22,plain,
( ~ sPE(axiom(or(not(or(q,not(p))),or(not(p),q))),true)
| ~ sPE(true,true)
| ~ sPE(theorem(or(not(or(q,not(p))),or(not(p),q))),theorem(or(not(or(q,not(p))),or(not(p),q))))
| ~ sPE(true,true)
| sPE(ifeq(axiom(or(not(or(q,not(p))),or(not(p),q))),true,theorem(or(not(or(q,not(p))),or(not(p),q))),true),ifeq(true,true,theorem(or(not(or(q,not(p))),or(not(p),q))),true)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g23,plain,
sPE(theorem(or(not(or(q,not(p))),or(not(p),q))),theorem(or(not(or(q,not(p))),or(not(p),q)))),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.07 % Problem : LCL186-10 : TPTP v8.1.0. Released v7.5.0.
% 0.01/0.07 % Command : satcop --statistics %s
% 0.07/0.26 % Computer : n015.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 600
% 0.07/0.26 % DateTime : Mon Jul 4 03:58:45 EDT 2022
% 0.07/0.26 % CPUTime :
% 13.13/1.94 % symbols: 10
% 13.13/1.94 % clauses: 18
% 13.13/1.94 % start clauses: 1
% 13.13/1.94 % iterative deepening steps: 3265
% 13.13/1.94 % maximum path limit: 11
% 13.13/1.94 % literal attempts: 647136
% 13.13/1.94 % depth failures: 247012
% 13.13/1.94 % regularity failures: 69756
% 13.13/1.94 % tautology failures: 75541
% 13.13/1.94 % reductions: 0
% 13.13/1.94 % extensions: 645138
% 13.13/1.94 % SAT variables: 201148
% 13.13/1.94 % SAT clauses: 364643
% 13.13/1.94 % WalkSAT solutions: 364642
% 13.13/1.94 % CDCL solutions: 0
% 13.13/1.94 % SZS status Unsatisfiable for theBenchmark
% 13.13/1.94 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------