TSTP Solution File: LCL250-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL250-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n017.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 : 300s
% DateTime : Fri May 3 02:37:28 EDT 2024
% Result : Unsatisfiable 49.64s 7.69s
% Output : CNFRefutation 49.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 52 ( 21 unt; 0 nHn; 34 RR)
% Number of literals : 97 ( 0 equ; 46 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 3 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 79 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(or(not(or(not(q),r)),or(not(not(or(not(p),not(q)))),r))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_50,plain,
axiom(or(not(or(X0,X0)),X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_2) ).
cnf(c_51,plain,
axiom(or(not(X0),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_3) ).
cnf(c_52,plain,
axiom(or(not(or(X0,X1)),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_4) ).
cnf(c_53,plain,
axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).
cnf(c_54,plain,
axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_6) ).
cnf(c_55,plain,
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_1) ).
cnf(c_56,plain,
( ~ axiom(or(not(X0),X1))
| ~ theorem(X0)
| theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_2) ).
cnf(c_57,plain,
( ~ theorem(or(not(X0),X1))
| ~ axiom(or(not(X2),X0))
| theorem(or(not(X2),X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_3) ).
cnf(c_218,plain,
( ~ axiom(or(not(or(X0,X1)),or(X1,X0)))
| theorem(or(not(or(X0,X1)),or(X1,X0))) ),
inference(instantiation,[status(thm)],[c_55]) ).
cnf(c_223,plain,
( ~ axiom(or(not(or(not(X0),X1)),X2))
| ~ theorem(or(not(X0),X1))
| theorem(X2) ),
inference(instantiation,[status(thm)],[c_56]) ).
cnf(c_227,plain,
( ~ theorem(or(not(X0),or(not(not(or(not(p),not(q)))),r)))
| ~ axiom(or(not(X1),X0))
| theorem(or(not(X1),or(not(not(or(not(p),not(q)))),r))) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_238,plain,
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(superposition,[status(thm)],[c_50,c_56]) ).
cnf(c_239,plain,
( ~ theorem(X0)
| theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_51,c_56]) ).
cnf(c_240,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_52,c_56]) ).
cnf(c_250,plain,
axiom(or(not(or(not(X0),X1)),or(X1,not(X0)))),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_253,plain,
( ~ axiom(or(not(or(not(X0),or(X1,X2))),or(X1,or(not(X0),X2))))
| ~ theorem(or(not(X0),or(X1,X2)))
| theorem(or(X1,or(not(X0),X2))) ),
inference(instantiation,[status(thm)],[c_223]) ).
cnf(c_254,plain,
axiom(or(not(or(not(X0),or(X1,X2))),or(X1,or(not(X0),X2)))),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_259,plain,
( ~ theorem(or(X0,or(X1,X2)))
| theorem(or(X1,or(X0,X2))) ),
inference(superposition,[status(thm)],[c_53,c_56]) ).
cnf(c_261,plain,
( ~ theorem(or(not(X0),X1))
| theorem(or(not(or(X2,X0)),or(X2,X1))) ),
inference(superposition,[status(thm)],[c_54,c_56]) ).
cnf(c_326,plain,
( ~ theorem(or(not(or(X0,X1)),or(not(not(or(not(p),not(q)))),r)))
| ~ axiom(or(not(X1),or(X0,X1)))
| theorem(or(not(X1),or(not(not(or(not(p),not(q)))),r))) ),
inference(instantiation,[status(thm)],[c_227]) ).
cnf(c_338,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X0,or(X2,X1))) ),
inference(superposition,[status(thm)],[c_239,c_259]) ).
cnf(c_379,plain,
( ~ axiom(or(not(or(not(not(or(not(p),not(q)))),or(not(X0),r))),or(not(X0),or(not(not(or(not(p),not(q)))),r))))
| ~ theorem(or(not(not(or(not(p),not(q)))),or(not(X0),r)))
| theorem(or(not(X0),or(not(not(or(not(p),not(q)))),r))) ),
inference(instantiation,[status(thm)],[c_253]) ).
cnf(c_431,plain,
axiom(or(not(or(not(not(or(not(p),not(q)))),or(not(X0),r))),or(not(X0),or(not(not(or(not(p),not(q)))),r)))),
inference(instantiation,[status(thm)],[c_254]) ).
cnf(c_573,plain,
axiom(or(not(or(X0,not(X1))),or(not(X1),X0))),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_634,plain,
( ~ theorem(or(or(X0,X1),X1))
| theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_338,c_238]) ).
cnf(c_670,plain,
axiom(or(not(not(or(not(p),not(q)))),or(X0,not(or(not(p),not(q)))))),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_678,plain,
( ~ axiom(or(not(not(or(not(p),not(q)))),X0))
| ~ theorem(or(not(X0),or(not(X1),r)))
| theorem(or(not(not(or(not(p),not(q)))),or(not(X1),r))) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_937,plain,
( ~ axiom(or(not(or(X0,not(X1))),or(not(X1),X0)))
| theorem(or(not(or(X0,not(X1))),or(not(X1),X0))) ),
inference(instantiation,[status(thm)],[c_218]) ).
cnf(c_1141,plain,
( ~ axiom(or(not(not(or(not(p),not(q)))),or(X0,not(or(not(p),not(q))))))
| ~ theorem(or(not(or(X0,not(or(not(p),not(q))))),or(not(X1),r)))
| theorem(or(not(not(or(not(p),not(q)))),or(not(X1),r))) ),
inference(instantiation,[status(thm)],[c_678]) ).
cnf(c_1318,plain,
axiom(or(not(X0),or(not(X1),X0))),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_1426,plain,
( ~ theorem(or(or(X0,or(X1,X2)),X2))
| theorem(or(X0,or(X1,X2))) ),
inference(superposition,[status(thm)],[c_338,c_634]) ).
cnf(c_1450,plain,
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,or(not(or(X2,X0)),X1))) ),
inference(superposition,[status(thm)],[c_261,c_259]) ).
cnf(c_2083,plain,
( ~ theorem(or(not(or(r,not(or(not(p),not(q))))),or(not(or(not(p),not(q))),r)))
| ~ axiom(or(not(not(or(not(p),not(q)))),or(r,not(or(not(p),not(q))))))
| theorem(or(not(not(or(not(p),not(q)))),or(not(or(not(p),not(q))),r))) ),
inference(instantiation,[status(thm)],[c_1141]) ).
cnf(c_2084,plain,
( ~ axiom(or(not(or(r,not(or(not(p),not(q))))),or(not(or(not(p),not(q))),r)))
| theorem(or(not(or(r,not(or(not(p),not(q))))),or(not(or(not(p),not(q))),r))) ),
inference(instantiation,[status(thm)],[c_937]) ).
cnf(c_2117,plain,
axiom(or(not(or(not(X0),r)),or(r,not(X0)))),
inference(instantiation,[status(thm)],[c_250]) ).
cnf(c_2118,plain,
axiom(or(not(or(not(q),r)),or(r,not(q)))),
inference(instantiation,[status(thm)],[c_2117]) ).
cnf(c_4240,plain,
axiom(or(not(or(X0,not(or(not(p),not(q))))),or(not(or(not(p),not(q))),X0))),
inference(instantiation,[status(thm)],[c_573]) ).
cnf(c_4432,plain,
axiom(or(not(not(or(not(p),not(q)))),or(r,not(or(not(p),not(q)))))),
inference(instantiation,[status(thm)],[c_670]) ).
cnf(c_8731,plain,
axiom(or(not(or(r,not(or(not(p),not(q))))),or(not(or(not(p),not(q))),r))),
inference(instantiation,[status(thm)],[c_4240]) ).
cnf(c_10319,plain,
axiom(or(not(not(X0)),or(not(X1),not(X0)))),
inference(instantiation,[status(thm)],[c_1318]) ).
cnf(c_17935,plain,
( ~ axiom(or(not(or(not(not(or(not(p),not(q)))),or(not(or(not(p),not(q))),r))),or(not(or(not(p),not(q))),or(not(not(or(not(p),not(q)))),r))))
| ~ theorem(or(not(not(or(not(p),not(q)))),or(not(or(not(p),not(q))),r)))
| theorem(or(not(or(not(p),not(q))),or(not(not(or(not(p),not(q)))),r))) ),
inference(instantiation,[status(thm)],[c_379]) ).
cnf(c_29077,plain,
axiom(or(not(or(not(not(or(not(p),not(q)))),or(not(or(not(p),not(q))),r))),or(not(or(not(p),not(q))),or(not(not(or(not(p),not(q)))),r)))),
inference(instantiation,[status(thm)],[c_431]) ).
cnf(c_35232,plain,
axiom(or(not(not(q)),or(not(p),not(q)))),
inference(instantiation,[status(thm)],[c_10319]) ).
cnf(c_45405,plain,
( ~ theorem(or(not(or(not(p),not(q))),or(not(not(or(not(p),not(q)))),r)))
| ~ axiom(or(not(not(q)),or(not(p),not(q))))
| theorem(or(not(not(q)),or(not(not(or(not(p),not(q)))),r))) ),
inference(instantiation,[status(thm)],[c_326]) ).
cnf(c_54523,plain,
( ~ axiom(or(not(or(X0,X1)),or(X1,X0)))
| ~ theorem(or(not(or(X1,X0)),X2))
| theorem(or(not(or(X0,X1)),X2)) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_55727,plain,
( ~ theorem(or(X0,or(not(or(X0,X1)),X2)))
| theorem(or(or(not(or(X0,X1)),X2),X0)) ),
inference(instantiation,[status(thm)],[c_240]) ).
cnf(c_56682,plain,
( ~ theorem(or(not(or(r,not(q))),or(not(not(or(not(p),not(q)))),r)))
| ~ axiom(or(not(or(not(q),r)),or(r,not(q))))
| theorem(or(not(or(not(q),r)),or(not(not(or(not(p),not(q)))),r))) ),
inference(instantiation,[status(thm)],[c_54523]) ).
cnf(c_56841,plain,
( ~ theorem(or(or(not(or(r,not(q))),or(not(not(or(not(p),not(q)))),r)),r))
| theorem(or(not(or(r,not(q))),or(not(not(or(not(p),not(q)))),r))) ),
inference(instantiation,[status(thm)],[c_1426]) ).
cnf(c_59691,plain,
( ~ theorem(or(r,or(not(or(r,not(q))),or(not(not(or(not(p),not(q)))),r))))
| theorem(or(or(not(or(r,not(q))),or(not(not(or(not(p),not(q)))),r)),r)) ),
inference(instantiation,[status(thm)],[c_55727]) ).
cnf(c_65398,plain,
( ~ theorem(or(not(not(q)),or(not(not(or(not(p),not(q)))),r)))
| theorem(or(r,or(not(or(r,not(q))),or(not(not(or(not(p),not(q)))),r)))) ),
inference(instantiation,[status(thm)],[c_1450]) ).
cnf(c_65399,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_65398,c_59691,c_56841,c_56682,c_45405,c_35232,c_29077,c_17935,c_8731,c_4432,c_2118,c_2084,c_2083,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL250-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% 0.10/0.13 % Command : run_iprover %s %d THM
% 0.14/0.32 % Computer : n017.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Thu May 2 18:31:21 EDT 2024
% 0.14/0.33 % CPUTime :
% 0.19/0.45 Running first-order theorem proving
% 0.19/0.45 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 49.64/7.69 % SZS status Started for theBenchmark.p
% 49.64/7.69 % SZS status Unsatisfiable for theBenchmark.p
% 49.64/7.69
% 49.64/7.69 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 49.64/7.69
% 49.64/7.69 ------ iProver source info
% 49.64/7.69
% 49.64/7.69 git: date: 2024-05-02 19:28:25 +0000
% 49.64/7.69 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 49.64/7.69 git: non_committed_changes: false
% 49.64/7.69
% 49.64/7.69 ------ Parsing...successful
% 49.64/7.69
% 49.64/7.69
% 49.64/7.69
% 49.64/7.69 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 49.64/7.69
% 49.64/7.69 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 49.64/7.69 ------ Proving...
% 49.64/7.69 ------ Problem Properties
% 49.64/7.69
% 49.64/7.69
% 49.64/7.69 clauses 9
% 49.64/7.69 conjectures 1
% 49.64/7.69 EPR 1
% 49.64/7.69 Horn 9
% 49.64/7.69 unary 6
% 49.64/7.69 binary 1
% 49.64/7.69 lits 14
% 49.64/7.69 lits eq 0
% 49.64/7.69 fd_pure 0
% 49.64/7.69 fd_pseudo 0
% 49.64/7.69 fd_cond 0
% 49.64/7.69 fd_pseudo_cond 0
% 49.64/7.69 AC symbols 0
% 49.64/7.69
% 49.64/7.69 ------ Input Options Time Limit: Unbounded
% 49.64/7.69
% 49.64/7.69
% 49.64/7.69 ------
% 49.64/7.69 Current options:
% 49.64/7.69 ------
% 49.64/7.69
% 49.64/7.69
% 49.64/7.69
% 49.64/7.69
% 49.64/7.69 ------ Proving...
% 49.64/7.69
% 49.64/7.69
% 49.64/7.69 % SZS status Unsatisfiable for theBenchmark.p
% 49.64/7.69
% 49.64/7.69 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 49.64/7.69
% 49.64/7.70
%------------------------------------------------------------------------------