TSTP Solution File: LCL294-3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL294-3 : TPTP v8.1.2. Released 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 : Thu Aug 31 07:43:46 EDT 2023
% Result : Unsatisfiable 0.45s 1.15s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of clauses : 46 ( 25 unt; 0 nHn; 16 RR)
% Number of literals : 69 ( 9 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 : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 92 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(equivalent(implies(p,q),or(not(p),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_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_105,plain,
~ theorem(equivalent(implies(p,q),implies(p,q))),
inference(demodulation,[status(thm)],[c_49,c_57]) ).
cnf(c_106,plain,
not(implies(X0,not(X1))) = and(X0,X1),
inference(demodulation,[status(thm)],[c_51,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_339,plain,
theorem(implies(implies(X0,not(X0)),not(X0))),
inference(superposition,[status(thm)],[c_57,c_119]) ).
cnf(c_349,plain,
theorem(implies(implies(X0,or(X1,X2)),or(X1,or(not(X0),X2)))),
inference(superposition,[status(thm)],[c_57,c_137]) ).
cnf(c_360,plain,
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(superposition,[status(thm)],[c_119,c_59]) ).
cnf(c_361,plain,
( ~ theorem(X0)
| theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_125,c_59]) ).
cnf(c_362,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_131,c_59]) ).
cnf(c_363,plain,
( ~ theorem(or(X0,or(X1,X2)))
| theorem(or(X1,or(X0,X2))) ),
inference(superposition,[status(thm)],[c_137,c_59]) ).
cnf(c_388,plain,
implies(implies(X0,not(X1)),X2) = or(and(X0,X1),X2),
inference(superposition,[status(thm)],[c_106,c_57]) ).
cnf(c_391,plain,
theorem(or(and(X0,X0),not(X0))),
inference(demodulation,[status(thm)],[c_339,c_388]) ).
cnf(c_435,plain,
theorem(or(not(X0),and(X0,X0))),
inference(superposition,[status(thm)],[c_391,c_362]) ).
cnf(c_456,plain,
theorem(implies(X0,and(X0,X0))),
inference(demodulation,[status(thm)],[c_435,c_57]) ).
cnf(c_458,plain,
( ~ theorem(X0)
| theorem(and(X0,X0)) ),
inference(superposition,[status(thm)],[c_456,c_59]) ).
cnf(c_471,plain,
( ~ theorem(implies(X0,X0))
| theorem(equivalent(X0,X0)) ),
inference(superposition,[status(thm)],[c_50,c_458]) ).
cnf(c_650,plain,
theorem(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))),
inference(demodulation,[status(thm)],[c_349,c_57]) ).
cnf(c_653,plain,
( ~ theorem(implies(X0,or(X1,X2)))
| theorem(or(X1,implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_650,c_59]) ).
cnf(c_733,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X0,or(X2,X1))) ),
inference(superposition,[status(thm)],[c_361,c_363]) ).
cnf(c_847,plain,
( ~ theorem(or(not(X0),X1))
| theorem(implies(X0,or(X2,X1))) ),
inference(superposition,[status(thm)],[c_57,c_733]) ).
cnf(c_860,plain,
( ~ theorem(implies(X0,X1))
| theorem(implies(X0,or(X2,X1))) ),
inference(light_normalisation,[status(thm)],[c_847,c_57]) ).
cnf(c_1001,plain,
( ~ theorem(implies(X0,X1))
| ~ theorem(X0)
| theorem(or(X2,X1)) ),
inference(superposition,[status(thm)],[c_860,c_59]) ).
cnf(c_1086,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X2,or(X1,X0))) ),
inference(superposition,[status(thm)],[c_131,c_1001]) ).
cnf(c_1585,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X1,or(X2,X0))) ),
inference(superposition,[status(thm)],[c_1086,c_363]) ).
cnf(c_1892,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X1,implies(X2,X0))) ),
inference(superposition,[status(thm)],[c_57,c_1585]) ).
cnf(c_2182,plain,
( ~ theorem(or(X0,implies(X1,X0)))
| theorem(implies(X1,X0)) ),
inference(superposition,[status(thm)],[c_1892,c_360]) ).
cnf(c_3736,plain,
theorem(or(X0,implies(X1,X1))),
inference(superposition,[status(thm)],[c_125,c_653]) ).
cnf(c_3841,plain,
theorem(implies(X0,X0)),
inference(superposition,[status(thm)],[c_3736,c_2182]) ).
cnf(c_3845,plain,
theorem(equivalent(X0,X0)),
inference(backward_subsumption_resolution,[status(thm)],[c_471,c_3841]) ).
cnf(c_3846,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_105,c_3845]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL294-3 : TPTP v8.1.2. Released v2.3.0.
% 0.06/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n017.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Thu Aug 24 18:28:24 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.17/0.45 Running first-order theorem proving
% 0.17/0.45 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.45/1.15 % SZS status Started for theBenchmark.p
% 0.45/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 0.45/1.15
% 0.45/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.45/1.15
% 0.45/1.15 ------ iProver source info
% 0.45/1.15
% 0.45/1.15 git: date: 2023-05-31 18:12:56 +0000
% 0.45/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.45/1.15 git: non_committed_changes: false
% 0.45/1.15 git: last_make_outside_of_git: false
% 0.45/1.15
% 0.45/1.15 ------ Parsing...successful
% 0.45/1.15
% 0.45/1.15
% 0.45/1.15
% 0.45/1.15 ------ 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
% 0.45/1.15
% 0.45/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.45/1.15
% 0.45/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.45/1.15 ------ Proving...
% 0.45/1.15 ------ Problem Properties
% 0.45/1.15
% 0.45/1.15
% 0.45/1.15 clauses 10
% 0.45/1.15 conjectures 0
% 0.45/1.15 EPR 0
% 0.45/1.15 Horn 10
% 0.45/1.15 unary 9
% 0.45/1.15 binary 0
% 0.45/1.15 lits 12
% 0.45/1.15 lits eq 3
% 0.45/1.15 fd_pure 0
% 0.45/1.15 fd_pseudo 0
% 0.45/1.15 fd_cond 0
% 0.45/1.15 fd_pseudo_cond 0
% 0.45/1.15 AC symbols 0
% 0.45/1.15
% 0.45/1.15 ------ Schedule dynamic 5 is on
% 0.45/1.15
% 0.45/1.15 ------ no conjectures: strip conj schedule
% 0.45/1.15
% 0.45/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 0.45/1.15
% 0.45/1.15
% 0.45/1.15 ------
% 0.45/1.15 Current options:
% 0.45/1.15 ------
% 0.45/1.15
% 0.45/1.15
% 0.45/1.15
% 0.45/1.15
% 0.45/1.15 ------ Proving...
% 0.45/1.15
% 0.45/1.15
% 0.45/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 0.45/1.15
% 0.45/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.45/1.15
% 0.45/1.15
%------------------------------------------------------------------------------