TSTP Solution File: LCL341-3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL341-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n023.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:58 EDT 2023
% Result : Unsatisfiable 161.99s 22.26s
% Output : CNFRefutation 161.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of clauses : 91 ( 41 unt; 0 nHn; 41 RR)
% Number of literals : 153 ( 28 equ; 63 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 : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 178 ( 26 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(implies(p,equivalent(implies(p,q),q))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_50,plain,
and(implies(X0,X1),implies(X1,X0)) = equivalent(X0,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
cnf(c_51,plain,
not(or(not(X0),not(X1))) = and(X0,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-1.ax',and_defn) ).
cnf(c_52,plain,
axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
cnf(c_53,plain,
axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(c_54,plain,
axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
cnf(c_55,plain,
axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
cnf(c_56,plain,
axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
cnf(c_57,plain,
or(not(X0),X1) = implies(X0,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(c_58,plain,
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_1) ).
cnf(c_59,plain,
( ~ theorem(implies(X0,X1))
| ~ theorem(X0)
| theorem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(c_97,plain,
not(implies(X0,not(X1))) = and(X0,X1),
inference(demodulation,[status(thm)],[c_51,c_57]) ).
cnf(c_109,plain,
( implies(or(X0,X0),X0) != X1
| theorem(X1) ),
inference(resolution_lifted,[status(thm)],[c_52,c_58]) ).
cnf(c_110,plain,
theorem(implies(or(X0,X0),X0)),
inference(unflattening,[status(thm)],[c_109]) ).
cnf(c_115,plain,
( implies(X0,or(X1,X0)) != X2
| theorem(X2) ),
inference(resolution_lifted,[status(thm)],[c_53,c_58]) ).
cnf(c_116,plain,
theorem(implies(X0,or(X1,X0))),
inference(unflattening,[status(thm)],[c_115]) ).
cnf(c_121,plain,
( implies(or(X0,X1),or(X1,X0)) != X2
| theorem(X2) ),
inference(resolution_lifted,[status(thm)],[c_54,c_58]) ).
cnf(c_122,plain,
theorem(implies(or(X0,X1),or(X1,X0))),
inference(unflattening,[status(thm)],[c_121]) ).
cnf(c_127,plain,
( implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))) != X3
| theorem(X3) ),
inference(resolution_lifted,[status(thm)],[c_55,c_58]) ).
cnf(c_128,plain,
theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(unflattening,[status(thm)],[c_127]) ).
cnf(c_133,plain,
( implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1))) != X3
| theorem(X3) ),
inference(resolution_lifted,[status(thm)],[c_56,c_58]) ).
cnf(c_134,plain,
theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(unflattening,[status(thm)],[c_133]) ).
cnf(c_179,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_182,plain,
( X0 != X1
| ~ theorem(X1)
| theorem(X0) ),
theory(equality) ).
cnf(c_327,plain,
( implies(p,equivalent(implies(p,q),q)) != X0
| ~ theorem(X0)
| theorem(implies(p,equivalent(implies(p,q),q))) ),
inference(instantiation,[status(thm)],[c_182]) ).
cnf(c_436,plain,
( implies(p,equivalent(implies(p,q),q)) != X0
| X1 != X0
| implies(p,equivalent(implies(p,q),q)) = X1 ),
inference(instantiation,[status(thm)],[c_179]) ).
cnf(c_440,plain,
theorem(implies(or(X0,not(X1)),implies(X1,X0))),
inference(superposition,[status(thm)],[c_57,c_122]) ).
cnf(c_442,plain,
theorem(implies(implies(X0,X1),or(X1,not(X0)))),
inference(superposition,[status(thm)],[c_57,c_122]) ).
cnf(c_479,plain,
theorem(implies(implies(X0,not(X1)),implies(X1,not(X0)))),
inference(superposition,[status(thm)],[c_57,c_440]) ).
cnf(c_485,plain,
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(superposition,[status(thm)],[c_110,c_59]) ).
cnf(c_486,plain,
( ~ theorem(X0)
| theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_116,c_59]) ).
cnf(c_487,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_122,c_59]) ).
cnf(c_489,plain,
( ~ theorem(or(X0,not(X1)))
| theorem(implies(X1,X0)) ),
inference(superposition,[status(thm)],[c_440,c_59]) ).
cnf(c_500,plain,
( implies(p,equivalent(implies(p,q),q)) != implies(p,equivalent(implies(p,q),q))
| X0 != implies(p,equivalent(implies(p,q),q))
| implies(p,equivalent(implies(p,q),q)) = X0 ),
inference(instantiation,[status(thm)],[c_436]) ).
cnf(c_501,plain,
( X0 != implies(p,equivalent(implies(p,q),q))
| implies(p,equivalent(implies(p,q),q)) = X0 ),
inference(equality_resolution_simp,[status(thm)],[c_500]) ).
cnf(c_552,plain,
theorem(implies(implies(X0,not(X0)),not(X0))),
inference(superposition,[status(thm)],[c_57,c_110]) ).
cnf(c_576,plain,
implies(implies(X0,not(X1)),X2) = or(and(X0,X1),X2),
inference(superposition,[status(thm)],[c_97,c_57]) ).
cnf(c_657,plain,
( ~ theorem(implies(X0,not(X1)))
| theorem(implies(X1,not(X0))) ),
inference(superposition,[status(thm)],[c_479,c_59]) ).
cnf(c_769,plain,
( or(not(p),equivalent(implies(p,q),q)) != implies(p,equivalent(implies(p,q),q))
| implies(p,equivalent(implies(p,q),q)) = or(not(p),equivalent(implies(p,q),q)) ),
inference(instantiation,[status(thm)],[c_501]) ).
cnf(c_842,plain,
theorem(implies(X0,not(implies(X0,not(X0))))),
inference(superposition,[status(thm)],[c_552,c_657]) ).
cnf(c_947,plain,
theorem(implies(X0,implies(X1,X0))),
inference(superposition,[status(thm)],[c_57,c_116]) ).
cnf(c_954,plain,
theorem(implies(X0,and(X0,X0))),
inference(superposition,[status(thm)],[c_97,c_842]) ).
cnf(c_996,plain,
( ~ theorem(X0)
| theorem(and(X0,X0)) ),
inference(superposition,[status(thm)],[c_954,c_59]) ).
cnf(c_1064,plain,
( ~ theorem(implies(X0,X0))
| theorem(equivalent(X0,X0)) ),
inference(superposition,[status(thm)],[c_50,c_996]) ).
cnf(c_1065,plain,
( ~ theorem(implies(p,p))
| theorem(equivalent(p,p)) ),
inference(instantiation,[status(thm)],[c_1064]) ).
cnf(c_1242,plain,
theorem(implies(X0,or(and(X1,X2),X0))),
inference(superposition,[status(thm)],[c_576,c_947]) ).
cnf(c_1255,plain,
theorem(or(and(X0,X1),or(not(X1),not(X0)))),
inference(superposition,[status(thm)],[c_576,c_442]) ).
cnf(c_2073,plain,
or(not(p),equivalent(implies(p,q),q)) = implies(p,equivalent(implies(p,q),q)),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_2715,plain,
( implies(p,equivalent(implies(p,q),q)) != or(not(X0),X1)
| ~ theorem(or(not(X0),X1))
| theorem(implies(p,equivalent(implies(p,q),q))) ),
inference(instantiation,[status(thm)],[c_327]) ).
cnf(c_3117,plain,
theorem(implies(implies(X0,or(X1,X2)),or(X1,or(not(X0),X2)))),
inference(superposition,[status(thm)],[c_57,c_128]) ).
cnf(c_3118,plain,
theorem(implies(or(X0,implies(X1,X2)),or(not(X1),or(X0,X2)))),
inference(superposition,[status(thm)],[c_57,c_128]) ).
cnf(c_3121,plain,
( ~ theorem(or(X0,or(X1,X2)))
| theorem(or(X1,or(X0,X2))) ),
inference(superposition,[status(thm)],[c_128,c_59]) ).
cnf(c_3208,plain,
( ~ theorem(implies(X0,X1))
| theorem(implies(or(X2,X0),or(X2,X1))) ),
inference(superposition,[status(thm)],[c_134,c_59]) ).
cnf(c_3826,plain,
theorem(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))),
inference(superposition,[status(thm)],[c_57,c_3117]) ).
cnf(c_4172,plain,
theorem(implies(or(X0,implies(X1,X2)),implies(X1,or(X0,X2)))),
inference(superposition,[status(thm)],[c_57,c_3118]) ).
cnf(c_4265,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X0,or(X2,X1))) ),
inference(superposition,[status(thm)],[c_486,c_3121]) ).
cnf(c_4269,plain,
theorem(or(not(X0),or(and(X1,X0),not(X1)))),
inference(superposition,[status(thm)],[c_1255,c_3121]) ).
cnf(c_5483,plain,
( ~ theorem(implies(X0,X1))
| ~ theorem(or(X2,X0))
| theorem(or(X2,X1)) ),
inference(superposition,[status(thm)],[c_3208,c_59]) ).
cnf(c_5514,plain,
theorem(implies(X0,or(and(X1,X0),not(X1)))),
inference(superposition,[status(thm)],[c_57,c_4269]) ).
cnf(c_5581,plain,
( ~ theorem(X0)
| theorem(or(and(X1,X0),not(X1))) ),
inference(superposition,[status(thm)],[c_5514,c_59]) ).
cnf(c_5818,plain,
( ~ theorem(X0)
| theorem(implies(X1,and(X1,X0))) ),
inference(superposition,[status(thm)],[c_5581,c_489]) ).
cnf(c_6328,plain,
( ~ theorem(implies(X0,X1))
| theorem(implies(implies(X1,X0),equivalent(X1,X0))) ),
inference(superposition,[status(thm)],[c_50,c_5818]) ).
cnf(c_6673,plain,
( ~ theorem(implies(X0,or(X1,X2)))
| theorem(or(X1,implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_3826,c_59]) ).
cnf(c_6725,plain,
theorem(implies(or(not(X0),implies(X1,X2)),implies(X1,implies(X0,X2)))),
inference(superposition,[status(thm)],[c_57,c_4172]) ).
cnf(c_7342,plain,
( ~ theorem(or(not(X0),X1))
| theorem(implies(X0,or(X2,X1))) ),
inference(superposition,[status(thm)],[c_57,c_4265]) ).
cnf(c_7347,plain,
( ~ theorem(or(or(X0,X1),X1))
| theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_4265,c_485]) ).
cnf(c_7348,plain,
( ~ theorem(or(X0,X1))
| theorem(or(or(X2,X1),X0)) ),
inference(superposition,[status(thm)],[c_4265,c_487]) ).
cnf(c_8136,plain,
( ~ theorem(or(not(X0),X1))
| ~ theorem(X0)
| theorem(or(X2,X1)) ),
inference(superposition,[status(thm)],[c_7342,c_59]) ).
cnf(c_8285,plain,
( ~ theorem(or(implies(X0,X1),X1))
| theorem(or(not(X0),X1)) ),
inference(superposition,[status(thm)],[c_57,c_7347]) ).
cnf(c_8313,plain,
( ~ theorem(or(X0,X0))
| theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_7348,c_7347]) ).
cnf(c_8329,plain,
theorem(implies(X0,or(equivalent(X1,X2),X0))),
inference(superposition,[status(thm)],[c_50,c_1242]) ).
cnf(c_8331,plain,
( ~ theorem(X0)
| theorem(or(equivalent(X1,X2),X0)) ),
inference(superposition,[status(thm)],[c_8329,c_59]) ).
cnf(c_8431,plain,
( ~ theorem(equivalent(X0,X1))
| theorem(or(X2,equivalent(X0,X1))) ),
inference(superposition,[status(thm)],[c_8331,c_8313]) ).
cnf(c_11863,plain,
( ~ theorem(equivalent(X0,X1))
| theorem(or(not(X2),equivalent(X0,X1))) ),
inference(superposition,[status(thm)],[c_8431,c_8285]) ).
cnf(c_12774,plain,
theorem(or(X0,implies(X1,X1))),
inference(superposition,[status(thm)],[c_116,c_6673]) ).
cnf(c_13103,plain,
theorem(implies(X0,X0)),
inference(superposition,[status(thm)],[c_12774,c_485]) ).
cnf(c_13109,plain,
theorem(implies(p,p)),
inference(instantiation,[status(thm)],[c_13103]) ).
cnf(c_13175,plain,
theorem(or(X0,implies(or(X0,X1),X1))),
inference(superposition,[status(thm)],[c_13103,c_6673]) ).
cnf(c_14894,plain,
( ~ theorem(or(not(X0),implies(X1,X2)))
| theorem(implies(X1,implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_6725,c_59]) ).
cnf(c_16498,plain,
( ~ theorem(X0)
| theorem(or(X1,implies(X2,X2))) ),
inference(superposition,[status(thm)],[c_12774,c_8136]) ).
cnf(c_17797,plain,
theorem(or(not(X0),implies(implies(X0,X1),X1))),
inference(superposition,[status(thm)],[c_57,c_13175]) ).
cnf(c_26923,plain,
( ~ theorem(equivalent(X0,X1))
| theorem(or(X2,implies(X3,X3))) ),
inference(superposition,[status(thm)],[c_11863,c_16498]) ).
cnf(c_28036,plain,
( implies(p,equivalent(implies(p,q),q)) != or(not(p),equivalent(implies(p,q),q))
| ~ theorem(or(not(p),equivalent(implies(p,q),q)))
| theorem(implies(p,equivalent(implies(p,q),q))) ),
inference(instantiation,[status(thm)],[c_2715]) ).
cnf(c_59627,plain,
( ~ theorem(implies(X0,equivalent(implies(p,q),q)))
| ~ theorem(or(not(p),X0))
| theorem(or(not(p),equivalent(implies(p,q),q))) ),
inference(instantiation,[status(thm)],[c_5483]) ).
cnf(c_75697,plain,
( ~ theorem(or(not(p),implies(q,q)))
| theorem(implies(q,implies(p,q))) ),
inference(instantiation,[status(thm)],[c_14894]) ).
cnf(c_75889,plain,
( ~ theorem(implies(q,implies(p,q)))
| theorem(implies(implies(implies(p,q),q),equivalent(implies(p,q),q))) ),
inference(instantiation,[status(thm)],[c_6328]) ).
cnf(c_79461,plain,
( ~ theorem(implies(implies(implies(p,q),q),equivalent(implies(p,q),q)))
| ~ theorem(or(not(p),implies(implies(p,q),q)))
| theorem(or(not(p),equivalent(implies(p,q),q))) ),
inference(instantiation,[status(thm)],[c_59627]) ).
cnf(c_675294,plain,
( ~ theorem(equivalent(X0,X1))
| theorem(or(not(p),implies(q,q))) ),
inference(instantiation,[status(thm)],[c_26923]) ).
cnf(c_675297,plain,
( ~ theorem(equivalent(p,p))
| theorem(or(not(p),implies(q,q))) ),
inference(instantiation,[status(thm)],[c_675294]) ).
cnf(c_679801,plain,
theorem(or(not(p),implies(implies(p,q),q))),
inference(instantiation,[status(thm)],[c_17797]) ).
cnf(c_679802,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_679801,c_675297,c_79461,c_75889,c_75697,c_28036,c_13109,c_2073,c_1065,c_769,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL341-3 : TPTP v8.1.2. Released v2.3.0.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n023.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 02:49:42 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.46 Running first-order theorem proving
% 0.20/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 161.99/22.26 % SZS status Started for theBenchmark.p
% 161.99/22.26 % SZS status Unsatisfiable for theBenchmark.p
% 161.99/22.26
% 161.99/22.26 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 161.99/22.26
% 161.99/22.26 ------ iProver source info
% 161.99/22.26
% 161.99/22.26 git: date: 2023-05-31 18:12:56 +0000
% 161.99/22.26 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 161.99/22.26 git: non_committed_changes: false
% 161.99/22.26 git: last_make_outside_of_git: false
% 161.99/22.26
% 161.99/22.26 ------ Parsing...successful
% 161.99/22.26
% 161.99/22.26
% 161.99/22.26
% 161.99/22.26 ------ 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
% 161.99/22.26
% 161.99/22.26 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 161.99/22.26
% 161.99/22.26 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 161.99/22.26 ------ Proving...
% 161.99/22.26 ------ Problem Properties
% 161.99/22.26
% 161.99/22.26
% 161.99/22.26 clauses 10
% 161.99/22.26 conjectures 1
% 161.99/22.26 EPR 0
% 161.99/22.26 Horn 10
% 161.99/22.26 unary 9
% 161.99/22.26 binary 0
% 161.99/22.26 lits 12
% 161.99/22.26 lits eq 3
% 161.99/22.26 fd_pure 0
% 161.99/22.26 fd_pseudo 0
% 161.99/22.26 fd_cond 0
% 161.99/22.26 fd_pseudo_cond 0
% 161.99/22.26 AC symbols 0
% 161.99/22.26
% 161.99/22.26 ------ Input Options Time Limit: Unbounded
% 161.99/22.26
% 161.99/22.26
% 161.99/22.26 ------
% 161.99/22.26 Current options:
% 161.99/22.26 ------
% 161.99/22.26
% 161.99/22.26
% 161.99/22.26
% 161.99/22.26
% 161.99/22.26 ------ Proving...
% 161.99/22.26
% 161.99/22.26
% 161.99/22.26 % SZS status Unsatisfiable for theBenchmark.p
% 161.99/22.26
% 161.99/22.26 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 161.99/22.26
% 161.99/22.28
%------------------------------------------------------------------------------