TSTP Solution File: LCL265-10 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL265-10 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n020.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:38 EDT 2023
% Result : Unsatisfiable 120.74s 16.17s
% Output : CNFRefutation 120.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 12
% Syntax : Number of clauses : 72 ( 72 unt; 0 nHn; 3 RR)
% Number of literals : 72 ( 71 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 2 con; 0-4 aty)
% Number of variables : 135 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
ifeq(X0,X0,X1,X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(c_50,plain,
axiom(implies(or(X0,X0),X0)) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_2) ).
cnf(c_51,plain,
axiom(implies(X0,or(X1,X0))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).
cnf(c_52,plain,
axiom(implies(or(X0,X1),or(X1,X0))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_4) ).
cnf(c_53,plain,
axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_5) ).
cnf(c_54,plain,
axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_6) ).
cnf(c_55,plain,
or(not(X0),X1) = implies(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_definition) ).
cnf(c_56,plain,
ifeq(axiom(X0),true,theorem(X0),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
cnf(c_57,plain,
ifeq(theorem(implies(X0,X1)),true,ifeq(theorem(X0),true,theorem(X1),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).
cnf(c_58,plain,
not(or(not(X0),not(X1))) = and(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_defn) ).
cnf(c_59,plain,
and(implies(X0,X1),implies(X1,X0)) = equivalent(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equivalent_defn) ).
cnf(c_60,negated_conjecture,
theorem(equivalent(p,not(not(p)))) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_96,plain,
not(implies(X0,not(X1))) = and(X0,X1),
inference(demodulation,[status(thm)],[c_58,c_55]) ).
cnf(c_209,plain,
ifeq(true,true,theorem(implies(or(X0,X0),X0)),true) = true,
inference(superposition,[status(thm)],[c_50,c_56]) ).
cnf(c_210,plain,
ifeq(true,true,theorem(implies(X0,or(X1,X0))),true) = true,
inference(superposition,[status(thm)],[c_51,c_56]) ).
cnf(c_216,plain,
implies(implies(X0,not(X1)),X2) = or(and(X0,X1),X2),
inference(superposition,[status(thm)],[c_96,c_55]) ).
cnf(c_222,plain,
ifeq(true,true,theorem(implies(or(X0,X1),or(X1,X0))),true) = true,
inference(superposition,[status(thm)],[c_52,c_56]) ).
cnf(c_235,plain,
ifeq(true,true,theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),true) = true,
inference(superposition,[status(thm)],[c_53,c_56]) ).
cnf(c_243,plain,
ifeq(true,true,theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),true) = true,
inference(superposition,[status(thm)],[c_54,c_56]) ).
cnf(c_260,plain,
theorem(implies(or(X0,X0),X0)) = true,
inference(superposition,[status(thm)],[c_209,c_49]) ).
cnf(c_264,plain,
ifeq(theorem(implies(implies(or(X0,X0),X0),X1)),true,ifeq(true,true,theorem(X1),true),true) = true,
inference(superposition,[status(thm)],[c_260,c_57]) ).
cnf(c_286,plain,
theorem(implies(X0,or(X1,X0))) = true,
inference(superposition,[status(thm)],[c_210,c_49]) ).
cnf(c_290,plain,
ifeq(theorem(implies(implies(X0,or(X1,X0)),X2)),true,ifeq(true,true,theorem(X2),true),true) = true,
inference(superposition,[status(thm)],[c_286,c_57]) ).
cnf(c_492,plain,
theorem(implies(or(X0,X1),or(X1,X0))) = true,
inference(superposition,[status(thm)],[c_222,c_49]) ).
cnf(c_499,plain,
ifeq(true,true,ifeq(theorem(or(X0,X1)),true,theorem(or(X1,X0)),true),true) = true,
inference(superposition,[status(thm)],[c_492,c_57]) ).
cnf(c_3756,plain,
ifeq(theorem(or(X0,X1)),true,theorem(or(X1,X0)),true) = true,
inference(superposition,[status(thm)],[c_499,c_49]) ).
cnf(c_3876,plain,
ifeq(theorem(implies(X0,X1)),true,theorem(or(X1,not(X0))),true) = true,
inference(superposition,[status(thm)],[c_55,c_3756]) ).
cnf(c_3915,plain,
ifeq(theorem(or(X0,not(X1))),true,theorem(implies(X1,X0)),true) = true,
inference(superposition,[status(thm)],[c_55,c_3756]) ).
cnf(c_13831,plain,
theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) = true,
inference(superposition,[status(thm)],[c_235,c_49]) ).
cnf(c_13836,plain,
theorem(implies(implies(X0,or(X1,X2)),or(X1,or(not(X0),X2)))) = true,
inference(superposition,[status(thm)],[c_55,c_13831]) ).
cnf(c_13871,plain,
theorem(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))) = true,
inference(superposition,[status(thm)],[c_55,c_13836]) ).
cnf(c_14125,plain,
theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))) = true,
inference(superposition,[status(thm)],[c_243,c_49]) ).
cnf(c_32341,plain,
ifeq(theorem(implies(implies(or(X0,X0),X0),X1)),true,theorem(X1),true) = true,
inference(superposition,[status(thm)],[c_49,c_264]) ).
cnf(c_33232,plain,
ifeq(true,true,theorem(implies(or(X0,or(X1,X1)),or(X0,X1))),true) = true,
inference(superposition,[status(thm)],[c_14125,c_32341]) ).
cnf(c_33853,plain,
theorem(implies(or(X0,or(X1,X1)),or(X0,X1))) = true,
inference(superposition,[status(thm)],[c_33232,c_49]) ).
cnf(c_33860,plain,
theorem(implies(implies(X0,or(X1,X1)),or(not(X0),X1))) = true,
inference(superposition,[status(thm)],[c_55,c_33853]) ).
cnf(c_33877,plain,
theorem(implies(implies(X0,or(X1,X1)),implies(X0,X1))) = true,
inference(light_normalisation,[status(thm)],[c_33860,c_55]) ).
cnf(c_36258,plain,
ifeq(theorem(implies(implies(X0,or(X1,X0)),X2)),true,theorem(X2),true) = true,
inference(superposition,[status(thm)],[c_49,c_290]) ).
cnf(c_37382,plain,
ifeq(true,true,theorem(implies(X0,X0)),true) = true,
inference(superposition,[status(thm)],[c_33877,c_36258]) ).
cnf(c_38513,plain,
theorem(implies(X0,X0)) = true,
inference(superposition,[status(thm)],[c_37382,c_49]) ).
cnf(c_38530,plain,
ifeq(theorem(implies(implies(X0,X0),X1)),true,ifeq(true,true,theorem(X1),true),true) = true,
inference(superposition,[status(thm)],[c_38513,c_57]) ).
cnf(c_38532,plain,
ifeq(true,true,theorem(or(X0,not(X0))),true) = true,
inference(superposition,[status(thm)],[c_38513,c_3876]) ).
cnf(c_40382,plain,
ifeq(theorem(implies(implies(X0,X0),X1)),true,theorem(X1),true) = true,
inference(superposition,[status(thm)],[c_49,c_38530]) ).
cnf(c_41434,plain,
theorem(or(X0,not(X0))) = true,
inference(superposition,[status(thm)],[c_38532,c_49]) ).
cnf(c_41455,plain,
ifeq(theorem(implies(or(X0,not(X0)),X1)),true,ifeq(true,true,theorem(X1),true),true) = true,
inference(superposition,[status(thm)],[c_41434,c_57]) ).
cnf(c_41636,plain,
ifeq(true,true,theorem(or(X0,implies(or(X0,X1),X1))),true) = true,
inference(superposition,[status(thm)],[c_13871,c_40382]) ).
cnf(c_47299,plain,
theorem(or(X0,implies(or(X0,X1),X1))) = true,
inference(superposition,[status(thm)],[c_41636,c_49]) ).
cnf(c_47306,plain,
theorem(implies(X0,implies(or(not(X0),X1),X1))) = true,
inference(superposition,[status(thm)],[c_55,c_47299]) ).
cnf(c_47332,plain,
theorem(implies(X0,implies(implies(X0,X1),X1))) = true,
inference(light_normalisation,[status(thm)],[c_47306,c_55]) ).
cnf(c_47356,plain,
ifeq(true,true,ifeq(theorem(X0),true,theorem(implies(implies(X0,X1),X1)),true),true) = true,
inference(superposition,[status(thm)],[c_47332,c_57]) ).
cnf(c_67884,plain,
ifeq(theorem(X0),true,theorem(implies(implies(X0,X1),X1)),true) = true,
inference(superposition,[status(thm)],[c_47356,c_49]) ).
cnf(c_68793,plain,
ifeq(true,true,theorem(implies(implies(or(X0,not(X0)),X1),X1)),true) = true,
inference(superposition,[status(thm)],[c_41434,c_67884]) ).
cnf(c_85398,plain,
theorem(implies(implies(or(X0,not(X0)),X1),X1)) = true,
inference(superposition,[status(thm)],[c_68793,c_49]) ).
cnf(c_85410,plain,
theorem(or(and(or(X0,not(X0)),X1),not(X1))) = true,
inference(superposition,[status(thm)],[c_216,c_85398]) ).
cnf(c_85539,plain,
ifeq(true,true,theorem(implies(X0,and(or(X1,not(X1)),X0))),true) = true,
inference(superposition,[status(thm)],[c_85410,c_3915]) ).
cnf(c_89259,plain,
theorem(implies(X0,and(or(X1,not(X1)),X0))) = true,
inference(superposition,[status(thm)],[c_85539,c_49]) ).
cnf(c_89300,plain,
ifeq(true,true,ifeq(theorem(X0),true,theorem(and(or(X1,not(X1)),X0)),true),true) = true,
inference(superposition,[status(thm)],[c_89259,c_57]) ).
cnf(c_125367,plain,
ifeq(theorem(implies(or(X0,not(X0)),X1)),true,theorem(X1),true) = true,
inference(superposition,[status(thm)],[c_49,c_41455]) ).
cnf(c_127259,plain,
ifeq(theorem(implies(implies(X0,not(not(X0))),X1)),true,theorem(X1),true) = true,
inference(superposition,[status(thm)],[c_55,c_125367]) ).
cnf(c_128088,plain,
ifeq(true,true,theorem(implies(or(X0,X1),or(X0,not(not(X1))))),true) = true,
inference(superposition,[status(thm)],[c_14125,c_127259]) ).
cnf(c_176657,plain,
ifeq(theorem(X0),true,theorem(and(or(X1,not(X1)),X0)),true) = true,
inference(superposition,[status(thm)],[c_89300,c_49]) ).
cnf(c_178470,plain,
ifeq(theorem(X0),true,theorem(and(implies(X1,not(not(X1))),X0)),true) = true,
inference(superposition,[status(thm)],[c_55,c_176657]) ).
cnf(c_180277,plain,
ifeq(theorem(implies(not(not(X0)),X0)),true,theorem(equivalent(X0,not(not(X0)))),true) = true,
inference(superposition,[status(thm)],[c_59,c_178470]) ).
cnf(c_258776,plain,
theorem(implies(or(X0,X1),or(X0,not(not(X1))))) = true,
inference(superposition,[status(thm)],[c_128088,c_49]) ).
cnf(c_258859,plain,
ifeq(true,true,theorem(or(X0,not(not(not(X0))))),true) = true,
inference(superposition,[status(thm)],[c_258776,c_125367]) ).
cnf(c_259312,plain,
theorem(or(X0,not(not(not(X0))))) = true,
inference(superposition,[status(thm)],[c_258859,c_49]) ).
cnf(c_259390,plain,
ifeq(true,true,theorem(implies(not(not(X0)),X0)),true) = true,
inference(superposition,[status(thm)],[c_259312,c_3915]) ).
cnf(c_259820,plain,
theorem(implies(not(not(X0)),X0)) = true,
inference(superposition,[status(thm)],[c_259390,c_49]) ).
cnf(c_259827,plain,
ifeq(true,true,theorem(equivalent(X0,not(not(X0)))),true) = true,
inference(demodulation,[status(thm)],[c_180277,c_259820]) ).
cnf(c_259950,plain,
theorem(equivalent(X0,not(not(X0)))) = true,
inference(superposition,[status(thm)],[c_259827,c_49]) ).
cnf(c_259957,plain,
true != true,
inference(demodulation,[status(thm)],[c_60,c_259950]) ).
cnf(c_259958,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_259957]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL265-10 : TPTP v8.1.2. Released v7.3.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.14/0.33 % Computer : n020.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Fri Aug 25 01:13:15 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running UEQ theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule casc_29_ueq --heuristic_context ueq --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 120.74/16.17 % SZS status Started for theBenchmark.p
% 120.74/16.17 % SZS status Unsatisfiable for theBenchmark.p
% 120.74/16.17
% 120.74/16.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 120.74/16.17
% 120.74/16.17 ------ iProver source info
% 120.74/16.17
% 120.74/16.17 git: date: 2023-05-31 18:12:56 +0000
% 120.74/16.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 120.74/16.17 git: non_committed_changes: false
% 120.74/16.17 git: last_make_outside_of_git: false
% 120.74/16.17
% 120.74/16.17 ------ Parsing...successful
% 120.74/16.17
% 120.74/16.17
% 120.74/16.17
% 120.74/16.17 ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e
% 120.74/16.17
% 120.74/16.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 120.74/16.17
% 120.74/16.17 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 120.74/16.17 ------ Proving...
% 120.74/16.17 ------ Problem Properties
% 120.74/16.17
% 120.74/16.17
% 120.74/16.17 clauses 12
% 120.74/16.17 conjectures 1
% 120.74/16.17 EPR 0
% 120.74/16.17 Horn 12
% 120.74/16.17 unary 12
% 120.74/16.17 binary 0
% 120.74/16.17 lits 12
% 120.74/16.17 lits eq 12
% 120.74/16.17 fd_pure 0
% 120.74/16.17 fd_pseudo 0
% 120.74/16.17 fd_cond 0
% 120.74/16.17 fd_pseudo_cond 0
% 120.74/16.17 AC symbols 0
% 120.74/16.17
% 120.74/16.17 ------ Input Options Time Limit: Unbounded
% 120.74/16.17
% 120.74/16.17
% 120.74/16.17 ------
% 120.74/16.17 Current options:
% 120.74/16.17 ------
% 120.74/16.17
% 120.74/16.17
% 120.74/16.17
% 120.74/16.17
% 120.74/16.17 ------ Proving...
% 120.74/16.17
% 120.74/16.17
% 120.74/16.17 % SZS status Unsatisfiable for theBenchmark.p
% 120.74/16.17
% 120.74/16.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 120.74/16.17
% 120.74/16.19
%------------------------------------------------------------------------------