TSTP Solution File: LCL298-3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL298-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n025.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:47 EDT 2023
% Result : Unsatisfiable 70.02s 10.31s
% Output : CNFRefutation 70.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 11
% Syntax : Number of clauses : 73 ( 42 unt; 0 nHn; 24 RR)
% Number of literals : 109 ( 10 equ; 38 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 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 : 158 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(equivalent(not(and(p,q)),or(not(p),not(q)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_50,plain,
and(implies(X0,X1),implies(X1,X0)) = equivalent(X0,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
cnf(c_51,plain,
not(or(not(X0),not(X1))) = and(X0,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-1.ax',and_defn) ).
cnf(c_52,plain,
axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
cnf(c_53,plain,
axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(c_54,plain,
axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
cnf(c_57,plain,
or(not(X0),X1) = implies(X0,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(c_58,plain,
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).
cnf(c_59,plain,
( ~ theorem(implies(X0,X1))
| ~ theorem(X0)
| theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(c_105,plain,
not(implies(X0,not(X1))) = and(X0,X1),
inference(demodulation,[status(thm)],[c_51,c_57]) ).
cnf(c_106,plain,
~ theorem(equivalent(not(and(p,q)),implies(p,not(q)))),
inference(demodulation,[status(thm)],[c_49,c_57]) ).
cnf(c_118,plain,
( implies(or(X0,X0),X0) != X1
| theorem(X1) ),
inference(resolution_lifted,[status(thm)],[c_52,c_58]) ).
cnf(c_119,plain,
theorem(implies(or(X0,X0),X0)),
inference(unflattening,[status(thm)],[c_118]) ).
cnf(c_124,plain,
( implies(X0,or(X1,X0)) != X2
| theorem(X2) ),
inference(resolution_lifted,[status(thm)],[c_53,c_58]) ).
cnf(c_125,plain,
theorem(implies(X0,or(X1,X0))),
inference(unflattening,[status(thm)],[c_124]) ).
cnf(c_130,plain,
( implies(or(X0,X1),or(X1,X0)) != X2
| theorem(X2) ),
inference(resolution_lifted,[status(thm)],[c_54,c_58]) ).
cnf(c_131,plain,
theorem(implies(or(X0,X1),or(X1,X0))),
inference(unflattening,[status(thm)],[c_130]) ).
cnf(c_136,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_137,plain,
theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(unflattening,[status(thm)],[c_136]) ).
cnf(c_142,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_143,plain,
theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(unflattening,[status(thm)],[c_142]) ).
cnf(c_340,plain,
theorem(implies(or(X0,not(X1)),implies(X1,X0))),
inference(superposition,[status(thm)],[c_57,c_131]) ).
cnf(c_365,plain,
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(superposition,[status(thm)],[c_119,c_59]) ).
cnf(c_366,plain,
( ~ theorem(X0)
| theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_125,c_59]) ).
cnf(c_367,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_131,c_59]) ).
cnf(c_369,plain,
( ~ theorem(or(X0,not(X1)))
| theorem(implies(X1,X0)) ),
inference(superposition,[status(thm)],[c_340,c_59]) ).
cnf(c_415,plain,
implies(implies(X0,not(X1)),X2) = or(and(X0,X1),X2),
inference(superposition,[status(thm)],[c_105,c_57]) ).
cnf(c_691,plain,
theorem(or(and(X0,X1),or(X2,implies(X0,not(X1))))),
inference(superposition,[status(thm)],[c_415,c_125]) ).
cnf(c_974,plain,
( ~ theorem(implies(X0,not(X1)))
| theorem(implies(X1,not(X0))) ),
inference(superposition,[status(thm)],[c_57,c_369]) ).
cnf(c_115603,plain,
theorem(implies(implies(X0,or(X1,X2)),or(X1,or(not(X0),X2)))),
inference(superposition,[status(thm)],[c_57,c_137]) ).
cnf(c_115604,plain,
theorem(implies(or(X0,implies(X1,X2)),or(not(X1),or(X0,X2)))),
inference(superposition,[status(thm)],[c_57,c_137]) ).
cnf(c_115607,plain,
( ~ theorem(or(X0,or(X1,X2)))
| theorem(or(X1,or(X0,X2))) ),
inference(superposition,[status(thm)],[c_137,c_59]) ).
cnf(c_115608,plain,
theorem(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))),
inference(demodulation,[status(thm)],[c_115603,c_57]) ).
cnf(c_115611,plain,
( ~ theorem(implies(X0,or(X1,X2)))
| theorem(or(X1,implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_115608,c_59]) ).
cnf(c_115612,plain,
theorem(implies(or(X0,implies(X1,X2)),implies(X1,or(X0,X2)))),
inference(demodulation,[status(thm)],[c_115604,c_57]) ).
cnf(c_115615,plain,
( ~ theorem(or(X0,implies(X1,X2)))
| theorem(implies(X1,or(X0,X2))) ),
inference(superposition,[status(thm)],[c_115612,c_59]) ).
cnf(c_115720,plain,
( ~ theorem(implies(X0,X1))
| theorem(implies(or(X2,X0),or(X2,X1))) ),
inference(superposition,[status(thm)],[c_143,c_59]) ).
cnf(c_115862,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X0,or(X2,X1))) ),
inference(superposition,[status(thm)],[c_366,c_115607]) ).
cnf(c_115864,plain,
theorem(or(X0,or(and(X1,X2),implies(X1,not(X2))))),
inference(superposition,[status(thm)],[c_691,c_115607]) ).
cnf(c_115916,plain,
( ~ theorem(or(not(X0),X1))
| theorem(implies(X0,or(X2,X1))) ),
inference(superposition,[status(thm)],[c_57,c_115862]) ).
cnf(c_115925,plain,
theorem(or(and(X0,X1),implies(X0,not(X1)))),
inference(superposition,[status(thm)],[c_115864,c_365]) ).
cnf(c_115980,plain,
( ~ theorem(implies(X0,X1))
| theorem(implies(X0,or(X2,X1))) ),
inference(light_normalisation,[status(thm)],[c_115916,c_57]) ).
cnf(c_115985,plain,
( ~ theorem(implies(X0,X1))
| ~ theorem(X0)
| theorem(or(X2,X1)) ),
inference(superposition,[status(thm)],[c_115980,c_59]) ).
cnf(c_116091,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X2,or(X1,X0))) ),
inference(superposition,[status(thm)],[c_131,c_115985]) ).
cnf(c_116225,plain,
theorem(or(X0,implies(X1,X1))),
inference(superposition,[status(thm)],[c_125,c_115611]) ).
cnf(c_116226,plain,
theorem(or(X0,implies(or(X1,X0),X1))),
inference(superposition,[status(thm)],[c_131,c_115611]) ).
cnf(c_116245,plain,
theorem(implies(X0,or(and(X0,X1),not(X1)))),
inference(superposition,[status(thm)],[c_115925,c_115615]) ).
cnf(c_116272,plain,
theorem(implies(X0,X0)),
inference(superposition,[status(thm)],[c_116225,c_365]) ).
cnf(c_116282,plain,
theorem(implies(X0,not(not(X0)))),
inference(superposition,[status(thm)],[c_116272,c_974]) ).
cnf(c_116311,plain,
theorem(or(implies(or(X0,X1),X0),X1)),
inference(superposition,[status(thm)],[c_116226,c_367]) ).
cnf(c_116357,plain,
theorem(or(X0,or(implies(or(X1,or(X0,X2)),X1),X2))),
inference(superposition,[status(thm)],[c_116311,c_115607]) ).
cnf(c_116463,plain,
( ~ theorem(X0)
| theorem(or(and(X0,X1),not(X1))) ),
inference(superposition,[status(thm)],[c_116245,c_59]) ).
cnf(c_116499,plain,
( ~ theorem(X0)
| theorem(implies(X1,and(X0,X1))) ),
inference(superposition,[status(thm)],[c_116463,c_369]) ).
cnf(c_116543,plain,
( ~ theorem(X0)
| ~ theorem(X1)
| theorem(and(X0,X1)) ),
inference(superposition,[status(thm)],[c_116499,c_59]) ).
cnf(c_116569,plain,
( ~ theorem(implies(X0,X1))
| ~ theorem(implies(X1,X0))
| theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_50,c_116543]) ).
cnf(c_116766,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X1,or(X2,X0))) ),
inference(superposition,[status(thm)],[c_116091,c_115607]) ).
cnf(c_116940,plain,
( ~ theorem(or(X0,or(X1,X0)))
| theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_116766,c_365]) ).
cnf(c_117460,plain,
( ~ theorem(or(X0,X1))
| ~ theorem(implies(X1,X2))
| theorem(or(X0,X2)) ),
inference(superposition,[status(thm)],[c_115720,c_59]) ).
cnf(c_117484,plain,
theorem(or(implies(or(X0,or(X1,X1)),X0),X1)),
inference(superposition,[status(thm)],[c_116357,c_116940]) ).
cnf(c_117487,plain,
theorem(or(X0,implies(or(X1,or(X0,X0)),X1))),
inference(superposition,[status(thm)],[c_117484,c_367]) ).
cnf(c_117508,plain,
theorem(implies(or(X0,or(X1,X1)),or(X1,X0))),
inference(superposition,[status(thm)],[c_117487,c_115615]) ).
cnf(c_117510,plain,
theorem(implies(implies(X0,or(X1,X1)),or(X1,not(X0)))),
inference(superposition,[status(thm)],[c_57,c_117508]) ).
cnf(c_117552,plain,
( ~ theorem(implies(X0,or(X1,X1)))
| theorem(or(X1,not(X0))) ),
inference(superposition,[status(thm)],[c_117510,c_59]) ).
cnf(c_118061,plain,
theorem(or(X0,not(X0))),
inference(superposition,[status(thm)],[c_125,c_117552]) ).
cnf(c_144522,plain,
( ~ theorem(implies(not(X0),X1))
| theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_118061,c_117460]) ).
cnf(c_145868,plain,
theorem(or(X0,not(not(not(X0))))),
inference(superposition,[status(thm)],[c_116282,c_144522]) ).
cnf(c_153520,plain,
theorem(implies(not(not(X0)),X0)),
inference(superposition,[status(thm)],[c_145868,c_369]) ).
cnf(c_153541,plain,
( ~ theorem(implies(X0,not(not(X0))))
| theorem(equivalent(not(not(X0)),X0)) ),
inference(superposition,[status(thm)],[c_153520,c_116569]) ).
cnf(c_153556,plain,
theorem(equivalent(not(not(X0)),X0)),
inference(forward_subsumption_resolution,[status(thm)],[c_153541,c_116282]) ).
cnf(c_153624,plain,
theorem(equivalent(not(and(X0,X1)),implies(X0,not(X1)))),
inference(superposition,[status(thm)],[c_105,c_153556]) ).
cnf(c_153627,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_106,c_153624]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : LCL298-3 : TPTP v8.1.2. Released v2.3.0.
% 0.00/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n025.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri Aug 25 00:43:22 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 70.02/10.31 % SZS status Started for theBenchmark.p
% 70.02/10.31 % SZS status Unsatisfiable for theBenchmark.p
% 70.02/10.31
% 70.02/10.31 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 70.02/10.31
% 70.02/10.31 ------ iProver source info
% 70.02/10.31
% 70.02/10.31 git: date: 2023-05-31 18:12:56 +0000
% 70.02/10.31 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 70.02/10.31 git: non_committed_changes: false
% 70.02/10.31 git: last_make_outside_of_git: false
% 70.02/10.31
% 70.02/10.31 ------ Parsing...successful
% 70.02/10.31
% 70.02/10.31
% 70.02/10.31
% 70.02/10.31 ------ Preprocessing... sup_sim: 2 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
% 70.02/10.31
% 70.02/10.31 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 70.02/10.31
% 70.02/10.31 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 70.02/10.31 ------ Proving...
% 70.02/10.31 ------ Problem Properties
% 70.02/10.31
% 70.02/10.31
% 70.02/10.31 clauses 10
% 70.02/10.31 conjectures 0
% 70.02/10.31 EPR 0
% 70.02/10.31 Horn 10
% 70.02/10.31 unary 9
% 70.02/10.31 binary 0
% 70.02/10.31 lits 12
% 70.02/10.31 lits eq 3
% 70.02/10.31 fd_pure 0
% 70.02/10.31 fd_pseudo 0
% 70.02/10.31 fd_cond 0
% 70.02/10.31 fd_pseudo_cond 0
% 70.02/10.31 AC symbols 0
% 70.02/10.31
% 70.02/10.31 ------ Input Options Time Limit: Unbounded
% 70.02/10.31
% 70.02/10.31
% 70.02/10.31 ------
% 70.02/10.31 Current options:
% 70.02/10.31 ------
% 70.02/10.31
% 70.02/10.31
% 70.02/10.31
% 70.02/10.31
% 70.02/10.31 ------ Proving...
% 70.02/10.31
% 70.02/10.31
% 70.02/10.31 % SZS status Unsatisfiable for theBenchmark.p
% 70.02/10.31
% 70.02/10.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 70.02/10.31
% 70.02/10.32
%------------------------------------------------------------------------------