TSTP Solution File: LCL203-3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL203-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n031.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 : Thu Aug 31 07:43:07 EDT 2023
% Result : Unsatisfiable 14.68s 2.69s
% Output : CNFRefutation 14.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of clauses : 45 ( 27 unt; 0 nHn; 19 RR)
% Number of literals : 67 ( 6 equ; 25 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 98 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(implies(not(or(p,q)),or(not(p),not(q)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_50,plain,
axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
cnf(c_51,plain,
axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(c_52,plain,
axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
cnf(c_53,plain,
axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
cnf(c_54,plain,
axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
cnf(c_55,plain,
or(not(X0),X1) = implies(X0,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(c_56,plain,
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).
cnf(c_57,plain,
( ~ theorem(implies(X0,X1))
| ~ theorem(X0)
| theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(c_92,plain,
~ theorem(implies(not(or(p,q)),implies(p,not(q)))),
inference(demodulation,[status(thm)],[c_49,c_55]) ).
cnf(c_101,plain,
( implies(or(X0,X0),X0) != X1
| theorem(X1) ),
inference(resolution_lifted,[status(thm)],[c_50,c_56]) ).
cnf(c_102,plain,
theorem(implies(or(X0,X0),X0)),
inference(unflattening,[status(thm)],[c_101]) ).
cnf(c_107,plain,
( implies(X0,or(X1,X0)) != X2
| theorem(X2) ),
inference(resolution_lifted,[status(thm)],[c_51,c_56]) ).
cnf(c_108,plain,
theorem(implies(X0,or(X1,X0))),
inference(unflattening,[status(thm)],[c_107]) ).
cnf(c_113,plain,
( implies(or(X0,X1),or(X1,X0)) != X2
| theorem(X2) ),
inference(resolution_lifted,[status(thm)],[c_52,c_56]) ).
cnf(c_114,plain,
theorem(implies(or(X0,X1),or(X1,X0))),
inference(unflattening,[status(thm)],[c_113]) ).
cnf(c_119,plain,
( implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))) != X3
| theorem(X3) ),
inference(resolution_lifted,[status(thm)],[c_53,c_56]) ).
cnf(c_120,plain,
theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(unflattening,[status(thm)],[c_119]) ).
cnf(c_125,plain,
( implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1))) != X3
| theorem(X3) ),
inference(resolution_lifted,[status(thm)],[c_54,c_56]) ).
cnf(c_126,plain,
theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(unflattening,[status(thm)],[c_125]) ).
cnf(c_8216,plain,
theorem(implies(or(X0,not(X1)),implies(X1,X0))),
inference(superposition,[status(thm)],[c_55,c_114]) ).
cnf(c_8217,plain,
theorem(implies(X0,implies(X1,X0))),
inference(superposition,[status(thm)],[c_55,c_108]) ).
cnf(c_8222,plain,
theorem(implies(or(not(X0),or(X1,X2)),or(X1,implies(X0,X2)))),
inference(superposition,[status(thm)],[c_55,c_120]) ).
cnf(c_8223,plain,
theorem(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))),
inference(demodulation,[status(thm)],[c_8222,c_55]) ).
cnf(c_8231,plain,
theorem(implies(implies(X0,not(X1)),implies(X1,not(X0)))),
inference(superposition,[status(thm)],[c_55,c_8216]) ).
cnf(c_8234,plain,
theorem(implies(implies(X0,or(not(X1),X2)),implies(X1,implies(X0,X2)))),
inference(superposition,[status(thm)],[c_55,c_8223]) ).
cnf(c_8235,plain,
theorem(implies(implies(X0,implies(X1,X2)),implies(X1,implies(X0,X2)))),
inference(demodulation,[status(thm)],[c_8234,c_55]) ).
cnf(c_8244,plain,
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(superposition,[status(thm)],[c_102,c_57]) ).
cnf(c_8248,plain,
( ~ theorem(implies(X0,X1))
| theorem(implies(or(X2,X0),or(X2,X1))) ),
inference(superposition,[status(thm)],[c_126,c_57]) ).
cnf(c_8251,plain,
( ~ theorem(X0)
| theorem(implies(X1,X0)) ),
inference(superposition,[status(thm)],[c_8217,c_57]) ).
cnf(c_8253,plain,
( ~ theorem(implies(X0,not(X1)))
| theorem(implies(X1,not(X0))) ),
inference(superposition,[status(thm)],[c_8231,c_57]) ).
cnf(c_8254,plain,
( ~ theorem(implies(X0,or(X1,X2)))
| theorem(or(X1,implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_8223,c_57]) ).
cnf(c_8257,plain,
( ~ theorem(implies(X0,implies(X1,X2)))
| theorem(implies(X1,implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_8235,c_57]) ).
cnf(c_8280,plain,
( ~ theorem(or(X0,X1))
| ~ theorem(implies(X1,X2))
| theorem(or(X0,X2)) ),
inference(superposition,[status(thm)],[c_8248,c_57]) ).
cnf(c_8326,plain,
theorem(or(X0,implies(X1,X1))),
inference(superposition,[status(thm)],[c_108,c_8254]) ).
cnf(c_8355,plain,
( ~ theorem(implies(X0,X1))
| theorem(implies(X0,implies(X2,X1))) ),
inference(superposition,[status(thm)],[c_8251,c_8257]) ).
cnf(c_8372,plain,
( ~ theorem(implies(X0,X1))
| ~ theorem(implies(X1,X2))
| theorem(or(not(X0),X2)) ),
inference(superposition,[status(thm)],[c_55,c_8280]) ).
cnf(c_8373,plain,
( ~ theorem(implies(X0,X1))
| ~ theorem(implies(X1,X2))
| theorem(implies(X0,X2)) ),
inference(demodulation,[status(thm)],[c_8372,c_55]) ).
cnf(c_8400,plain,
theorem(implies(X0,X0)),
inference(superposition,[status(thm)],[c_8326,c_8244]) ).
cnf(c_8425,plain,
theorem(implies(X0,not(not(X0)))),
inference(superposition,[status(thm)],[c_8400,c_8253]) ).
cnf(c_8545,plain,
~ theorem(implies(not(or(p,q)),not(q))),
inference(superposition,[status(thm)],[c_8355,c_92]) ).
cnf(c_8692,plain,
( ~ theorem(implies(or(X0,X1),X2))
| theorem(implies(X1,X2)) ),
inference(superposition,[status(thm)],[c_108,c_8373]) ).
cnf(c_14617,plain,
theorem(implies(X0,not(not(or(X1,X0))))),
inference(superposition,[status(thm)],[c_8425,c_8692]) ).
cnf(c_19772,plain,
theorem(implies(not(or(X0,X1)),not(X1))),
inference(superposition,[status(thm)],[c_14617,c_8253]) ).
cnf(c_22794,plain,
$false,
inference(superposition,[status(thm)],[c_19772,c_8545]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL203-3 : TPTP v8.1.2. Released v2.3.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n031.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 : 300
% 0.13/0.34 % DateTime : Fri Aug 25 04:25:22 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 14.68/2.69 % SZS status Started for theBenchmark.p
% 14.68/2.69 % SZS status Unsatisfiable for theBenchmark.p
% 14.68/2.69
% 14.68/2.69 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 14.68/2.69
% 14.68/2.69 ------ iProver source info
% 14.68/2.69
% 14.68/2.69 git: date: 2023-05-31 18:12:56 +0000
% 14.68/2.69 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 14.68/2.69 git: non_committed_changes: false
% 14.68/2.69 git: last_make_outside_of_git: false
% 14.68/2.69
% 14.68/2.69 ------ Parsing...successful
% 14.68/2.69
% 14.68/2.69
% 14.68/2.69
% 14.68/2.69 ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 14.68/2.69
% 14.68/2.69 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 14.68/2.69
% 14.68/2.69 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 14.68/2.69 ------ Proving...
% 14.68/2.69 ------ Problem Properties
% 14.68/2.69
% 14.68/2.69
% 14.68/2.69 clauses 8
% 14.68/2.69 conjectures 0
% 14.68/2.69 EPR 0
% 14.68/2.69 Horn 8
% 14.68/2.69 unary 7
% 14.68/2.69 binary 0
% 14.68/2.69 lits 10
% 14.68/2.69 lits eq 1
% 14.68/2.69 fd_pure 0
% 14.68/2.69 fd_pseudo 0
% 14.68/2.69 fd_cond 0
% 14.68/2.69 fd_pseudo_cond 0
% 14.68/2.69 AC symbols 0
% 14.68/2.69
% 14.68/2.69 ------ Input Options Time Limit: Unbounded
% 14.68/2.69
% 14.68/2.69
% 14.68/2.69 ------
% 14.68/2.69 Current options:
% 14.68/2.69 ------
% 14.68/2.69
% 14.68/2.69
% 14.68/2.69
% 14.68/2.69
% 14.68/2.69 ------ Proving...
% 14.68/2.69
% 14.68/2.69
% 14.68/2.69 % SZS status Unsatisfiable for theBenchmark.p
% 14.68/2.69
% 14.68/2.69 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 14.68/2.69
% 14.68/2.69
%------------------------------------------------------------------------------