TSTP Solution File: LCL268-3 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL268-3 : TPTP v8.1.0. Released v2.3.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 14:14:14 EDT 2022
% Result : Unsatisfiable 50.15s 6.75s
% Output : Proof 50.15s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ theorem(equivalent(p,p)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this)]) ).
cnf(g1,plain,
axiom(implies(or(p,p),p)),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',axiom_1_2)]) ).
cnf(g2,plain,
axiom(implies(p,or(p,p))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',axiom_1_3)]) ).
cnf(g3,plain,
sPE(equivalent(p,p),and(implies(p,p),implies(p,p))),
inference(ground_cnf,[],[file('Axioms/LCL004-2.ax',equivalent_defn)]) ).
cnf(g4,plain,
sPE(and(implies(p,p),implies(p,p)),not(or(not(implies(p,p)),not(implies(p,p))))),
inference(ground_cnf,[],[file('Axioms/LCL004-1.ax',and_defn)]) ).
cnf(g5,plain,
sPE(implies(p,or(p,p)),or(not(p),or(p,p))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',implies_definition)]) ).
cnf(g6,plain,
( ~ theorem(implies(p,p))
| ~ theorem(implies(implies(p,p),equivalent(p,p)))
| theorem(equivalent(p,p)) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_2)]) ).
cnf(g7,plain,
( ~ axiom(implies(or(p,p),p))
| theorem(implies(or(p,p),p)) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_1)]) ).
cnf(g8,plain,
( ~ axiom(or(not(p),or(p,p)))
| theorem(or(not(p),or(p,p))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_1)]) ).
cnf(g9,plain,
( ~ sPE(implies(p,or(p,p)),or(not(p),or(p,p)))
| ~ axiom(implies(p,or(p,p)))
| axiom(or(not(p),or(p,p))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g10,plain,
sPE(implies(p,p),or(not(p),p)),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',implies_definition)]) ).
cnf(g11,plain,
sPE(not(implies(p,p)),not(implies(p,p))),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
( ~ sPE(or(not(p),p),implies(p,p))
| ~ theorem(or(not(p),p))
| theorem(implies(p,p)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g13,plain,
( ~ sPE(implies(p,p),or(not(p),p))
| sPE(or(not(p),p),implies(p,p)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g14,plain,
( ~ axiom(implies(or(not(implies(p,p)),not(implies(p,p))),not(implies(p,p))))
| theorem(implies(or(not(implies(p,p)),not(implies(p,p))),not(implies(p,p)))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_1)]) ).
cnf(g15,plain,
axiom(implies(or(not(implies(p,p)),not(implies(p,p))),not(implies(p,p)))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',axiom_1_2)]) ).
cnf(g16,plain,
sPE(implies(or(not(implies(p,p)),not(implies(p,p))),not(implies(p,p))),or(not(or(not(implies(p,p)),not(implies(p,p)))),not(implies(p,p)))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',implies_definition)]) ).
cnf(g17,plain,
( ~ theorem(or(not(p),or(p,p)))
| ~ theorem(implies(or(not(p),or(p,p)),or(not(p),p)))
| theorem(or(not(p),p)) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_2)]) ).
cnf(g18,plain,
( ~ theorem(implies(or(p,p),p))
| ~ theorem(implies(implies(or(p,p),p),implies(or(not(p),or(p,p)),or(not(p),p))))
| theorem(implies(or(not(p),or(p,p)),or(not(p),p))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_2)]) ).
cnf(g19,plain,
( ~ axiom(implies(implies(or(p,p),p),implies(or(not(p),or(p,p)),or(not(p),p))))
| theorem(implies(implies(or(p,p),p),implies(or(not(p),or(p,p)),or(not(p),p)))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_1)]) ).
cnf(g20,plain,
axiom(implies(implies(or(p,p),p),implies(or(not(p),or(p,p)),or(not(p),p)))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',axiom_1_6)]) ).
cnf(g21,plain,
( ~ sPE(implies(or(not(implies(p,p)),not(implies(p,p))),not(implies(p,p))),or(not(or(not(implies(p,p)),not(implies(p,p)))),not(implies(p,p))))
| sPE(or(not(or(not(implies(p,p)),not(implies(p,p)))),not(implies(p,p))),implies(or(not(implies(p,p)),not(implies(p,p))),not(implies(p,p)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g22,plain,
sPE(implies(implies(p,p),equivalent(p,p)),or(not(implies(p,p)),equivalent(p,p))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',implies_definition)]) ).
cnf(g23,plain,
( ~ sPE(and(implies(p,p),implies(p,p)),not(or(not(implies(p,p)),not(implies(p,p)))))
| ~ sPE(not(implies(p,p)),not(implies(p,p)))
| sPE(or(and(implies(p,p),implies(p,p)),not(implies(p,p))),or(not(or(not(implies(p,p)),not(implies(p,p)))),not(implies(p,p)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g24,plain,
( ~ sPE(equivalent(p,p),and(implies(p,p),implies(p,p)))
| ~ sPE(not(implies(p,p)),not(implies(p,p)))
| sPE(or(equivalent(p,p),not(implies(p,p))),or(and(implies(p,p),implies(p,p)),not(implies(p,p)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g25,plain,
axiom(implies(or(equivalent(p,p),not(implies(p,p))),or(not(implies(p,p)),equivalent(p,p)))),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',axiom_1_4)]) ).
cnf(g26,plain,
( ~ sPE(or(equivalent(p,p),not(implies(p,p))),or(and(implies(p,p),implies(p,p)),not(implies(p,p))))
| ~ sPE(or(and(implies(p,p),implies(p,p)),not(implies(p,p))),or(not(or(not(implies(p,p)),not(implies(p,p)))),not(implies(p,p))))
| sPE(or(equivalent(p,p),not(implies(p,p))),or(not(or(not(implies(p,p)),not(implies(p,p)))),not(implies(p,p)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g27,plain,
sPE(or(equivalent(p,p),not(implies(p,p))),or(equivalent(p,p),not(implies(p,p)))),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g28,plain,
( ~ sPE(implies(or(not(implies(p,p)),not(implies(p,p))),not(implies(p,p))),or(equivalent(p,p),not(implies(p,p))))
| ~ theorem(implies(or(not(implies(p,p)),not(implies(p,p))),not(implies(p,p))))
| theorem(or(equivalent(p,p),not(implies(p,p)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g29,plain,
( ~ sPE(or(equivalent(p,p),not(implies(p,p))),implies(or(not(implies(p,p)),not(implies(p,p))),not(implies(p,p))))
| sPE(implies(or(not(implies(p,p)),not(implies(p,p))),not(implies(p,p))),or(equivalent(p,p),not(implies(p,p)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g30,plain,
( ~ sPE(or(equivalent(p,p),not(implies(p,p))),or(not(or(not(implies(p,p)),not(implies(p,p)))),not(implies(p,p))))
| ~ sPE(or(not(or(not(implies(p,p)),not(implies(p,p)))),not(implies(p,p))),implies(or(not(implies(p,p)),not(implies(p,p))),not(implies(p,p))))
| sPE(or(equivalent(p,p),not(implies(p,p))),implies(or(not(implies(p,p)),not(implies(p,p))),not(implies(p,p)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g31,plain,
( ~ theorem(or(equivalent(p,p),not(implies(p,p))))
| ~ theorem(implies(or(equivalent(p,p),not(implies(p,p))),implies(implies(p,p),equivalent(p,p))))
| theorem(implies(implies(p,p),equivalent(p,p))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_2)]) ).
cnf(g32,plain,
( ~ sPE(implies(or(equivalent(p,p),not(implies(p,p))),or(not(implies(p,p)),equivalent(p,p))),implies(or(equivalent(p,p),not(implies(p,p))),implies(implies(p,p),equivalent(p,p))))
| ~ theorem(implies(or(equivalent(p,p),not(implies(p,p))),or(not(implies(p,p)),equivalent(p,p))))
| theorem(implies(or(equivalent(p,p),not(implies(p,p))),implies(implies(p,p),equivalent(p,p)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g33,plain,
( ~ axiom(implies(or(equivalent(p,p),not(implies(p,p))),or(not(implies(p,p)),equivalent(p,p))))
| theorem(implies(or(equivalent(p,p),not(implies(p,p))),or(not(implies(p,p)),equivalent(p,p)))) ),
inference(ground_cnf,[],[file('Axioms/LCL004-0.ax',rule_1)]) ).
cnf(g34,plain,
( ~ sPE(implies(or(equivalent(p,p),not(implies(p,p))),implies(implies(p,p),equivalent(p,p))),implies(or(equivalent(p,p),not(implies(p,p))),or(not(implies(p,p)),equivalent(p,p))))
| sPE(implies(or(equivalent(p,p),not(implies(p,p))),or(not(implies(p,p)),equivalent(p,p))),implies(or(equivalent(p,p),not(implies(p,p))),implies(implies(p,p),equivalent(p,p)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g35,plain,
( ~ sPE(or(equivalent(p,p),not(implies(p,p))),or(equivalent(p,p),not(implies(p,p))))
| ~ sPE(implies(implies(p,p),equivalent(p,p)),or(not(implies(p,p)),equivalent(p,p)))
| sPE(implies(or(equivalent(p,p),not(implies(p,p))),implies(implies(p,p),equivalent(p,p))),implies(or(equivalent(p,p),not(implies(p,p))),or(not(implies(p,p)),equivalent(p,p)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL268-3 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.12 % Command : satcop --statistics %s
% 0.12/0.33 % Computer : n011.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 : Sun Jul 3 21:14:51 EDT 2022
% 0.12/0.33 % CPUTime :
% 50.15/6.75 % symbols: 10
% 50.15/6.75 % clauses: 21
% 50.15/6.75 % start clauses: 1
% 50.15/6.75 % iterative deepening steps: 5854
% 50.15/6.75 % maximum path limit: 10
% 50.15/6.75 % literal attempts: 2891664
% 50.15/6.75 % depth failures: 1230695
% 50.15/6.75 % regularity failures: 202217
% 50.15/6.75 % tautology failures: 343160
% 50.15/6.75 % reductions: 0
% 50.15/6.75 % extensions: 2890152
% 50.15/6.75 % SAT variables: 907799
% 50.15/6.75 % SAT clauses: 1535991
% 50.15/6.75 % WalkSAT solutions: 1535990
% 50.15/6.75 % CDCL solutions: 0
% 50.15/6.75 % SZS status Unsatisfiable for theBenchmark
% 50.15/6.75 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------