TSTP Solution File: LCL269-3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL269-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n018.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 : Fri May 3 02:37:31 EDT 2024
% Result : Unsatisfiable 42.33s 6.76s
% Output : CNFRefutation 42.33s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(equivalent(equivalent(p,q),equivalent(q,p))),
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_117,plain,
( implies(or(X0,X0),X0) != X1
| theorem(X1) ),
inference(resolution_lifted,[status(thm)],[c_52,c_58]) ).
cnf(c_118,plain,
theorem(implies(or(X0,X0),X0)),
inference(unflattening,[status(thm)],[c_117]) ).
cnf(c_123,plain,
( implies(X0,or(X1,X0)) != X2
| theorem(X2) ),
inference(resolution_lifted,[status(thm)],[c_53,c_58]) ).
cnf(c_124,plain,
theorem(implies(X0,or(X1,X0))),
inference(unflattening,[status(thm)],[c_123]) ).
cnf(c_129,plain,
( implies(or(X0,X1),or(X1,X0)) != X2
| theorem(X2) ),
inference(resolution_lifted,[status(thm)],[c_54,c_58]) ).
cnf(c_130,plain,
theorem(implies(or(X0,X1),or(X1,X0))),
inference(unflattening,[status(thm)],[c_129]) ).
cnf(c_135,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_136,plain,
theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(unflattening,[status(thm)],[c_135]) ).
cnf(c_141,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_142,plain,
theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(unflattening,[status(thm)],[c_141]) ).
cnf(c_188,plain,
equivalent(p,q) = sP0_iProver_def,
definition ).
cnf(c_189,plain,
equivalent(q,p) = sP1_iProver_def,
definition ).
cnf(c_190,plain,
equivalent(sP0_iProver_def,sP1_iProver_def) = sP2_iProver_def,
definition ).
cnf(c_191,negated_conjecture,
~ theorem(sP2_iProver_def),
inference(demodulation,[status(thm)],[c_49,c_189,c_188,c_190]) ).
cnf(c_355,plain,
theorem(implies(or(X0,not(X1)),implies(X1,X0))),
inference(superposition,[status(thm)],[c_57,c_130]) ).
cnf(c_362,plain,
theorem(implies(implies(X0,or(X1,X2)),or(X1,or(not(X0),X2)))),
inference(superposition,[status(thm)],[c_57,c_136]) ).
cnf(c_363,plain,
theorem(implies(or(X0,implies(X1,X2)),or(not(X1),or(X0,X2)))),
inference(superposition,[status(thm)],[c_57,c_136]) ).
cnf(c_373,plain,
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(superposition,[status(thm)],[c_118,c_59]) ).
cnf(c_374,plain,
( ~ theorem(X0)
| theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_124,c_59]) ).
cnf(c_376,plain,
( ~ theorem(or(X0,or(X1,X2)))
| theorem(or(X1,or(X0,X2))) ),
inference(superposition,[status(thm)],[c_136,c_59]) ).
cnf(c_388,plain,
implies(implies(X0,not(X1)),X2) = or(and(X0,X1),X2),
inference(superposition,[status(thm)],[c_105,c_57]) ).
cnf(c_420,plain,
theorem(implies(implies(X0,not(X1)),implies(X1,not(X0)))),
inference(superposition,[status(thm)],[c_57,c_355]) ).
cnf(c_422,plain,
( ~ theorem(or(X0,not(X1)))
| theorem(implies(X1,X0)) ),
inference(superposition,[status(thm)],[c_355,c_59]) ).
cnf(c_497,plain,
( ~ theorem(implies(X0,X1))
| theorem(implies(or(X2,X0),or(X2,X1))) ),
inference(superposition,[status(thm)],[c_142,c_59]) ).
cnf(c_572,plain,
theorem(or(and(X0,X1),implies(X1,not(X0)))),
inference(demodulation,[status(thm)],[c_420,c_388]) ).
cnf(c_573,plain,
theorem(or(equivalent(X0,X1),implies(implies(X1,X0),not(implies(X0,X1))))),
inference(superposition,[status(thm)],[c_50,c_572]) ).
cnf(c_600,plain,
( ~ theorem(implies(X0,not(X1)))
| theorem(implies(X1,not(X0))) ),
inference(superposition,[status(thm)],[c_57,c_422]) ).
cnf(c_672,plain,
theorem(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))),
inference(demodulation,[status(thm)],[c_362,c_57]) ).
cnf(c_675,plain,
( ~ theorem(implies(X0,or(X1,X2)))
| theorem(or(X1,implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_672,c_59]) ).
cnf(c_681,plain,
theorem(implies(or(X0,implies(X1,X2)),implies(X1,or(X0,X2)))),
inference(demodulation,[status(thm)],[c_363,c_57]) ).
cnf(c_684,plain,
( ~ theorem(or(X0,implies(X1,X2)))
| theorem(implies(X1,or(X0,X2))) ),
inference(superposition,[status(thm)],[c_681,c_59]) ).
cnf(c_695,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X0,or(X2,X1))) ),
inference(superposition,[status(thm)],[c_374,c_376]) ).
cnf(c_832,plain,
( ~ theorem(or(not(X0),X1))
| theorem(implies(X0,or(X2,X1))) ),
inference(superposition,[status(thm)],[c_57,c_695]) ).
cnf(c_845,plain,
( ~ theorem(implies(X0,X1))
| theorem(implies(X0,or(X2,X1))) ),
inference(light_normalisation,[status(thm)],[c_832,c_57]) ).
cnf(c_881,plain,
( ~ theorem(implies(X0,X1))
| ~ theorem(X0)
| theorem(or(X2,X1)) ),
inference(superposition,[status(thm)],[c_845,c_59]) ).
cnf(c_1200,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X2,or(X1,X0))) ),
inference(superposition,[status(thm)],[c_130,c_881]) ).
cnf(c_1707,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X1,or(X2,X0))) ),
inference(superposition,[status(thm)],[c_1200,c_376]) ).
cnf(c_2320,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X1,implies(X2,X0))) ),
inference(superposition,[status(thm)],[c_57,c_1707]) ).
cnf(c_2498,plain,
( ~ theorem(implies(X0,X1))
| ~ theorem(or(X2,X0))
| theorem(or(X2,X1)) ),
inference(superposition,[status(thm)],[c_497,c_59]) ).
cnf(c_2540,plain,
( ~ theorem(or(X0,implies(X1,X0)))
| theorem(implies(X1,X0)) ),
inference(superposition,[status(thm)],[c_2320,c_373]) ).
cnf(c_3118,plain,
theorem(or(sP2_iProver_def,implies(implies(sP1_iProver_def,sP0_iProver_def),not(implies(sP0_iProver_def,sP1_iProver_def))))),
inference(superposition,[status(thm)],[c_190,c_573]) ).
cnf(c_3725,plain,
theorem(or(X0,implies(X1,X1))),
inference(superposition,[status(thm)],[c_124,c_675]) ).
cnf(c_3726,plain,
theorem(or(X0,implies(or(X1,X0),X1))),
inference(superposition,[status(thm)],[c_130,c_675]) ).
cnf(c_3825,plain,
theorem(implies(X0,X0)),
inference(superposition,[status(thm)],[c_3725,c_2540]) ).
cnf(c_3856,plain,
theorem(implies(X0,not(not(X0)))),
inference(superposition,[status(thm)],[c_3825,c_600]) ).
cnf(c_3931,plain,
theorem(implies(X0,implies(or(X1,not(X0)),X1))),
inference(superposition,[status(thm)],[c_57,c_3726]) ).
cnf(c_3951,plain,
( ~ theorem(X0)
| theorem(implies(or(X1,not(X0)),X1)) ),
inference(superposition,[status(thm)],[c_3931,c_59]) ).
cnf(c_4041,plain,
( ~ theorem(or(X0,not(X1)))
| ~ theorem(X1)
| theorem(X0) ),
inference(superposition,[status(thm)],[c_3951,c_59]) ).
cnf(c_5019,plain,
theorem(implies(implies(sP1_iProver_def,sP0_iProver_def),or(sP2_iProver_def,not(implies(sP0_iProver_def,sP1_iProver_def))))),
inference(superposition,[status(thm)],[c_3118,c_684]) ).
cnf(c_5650,plain,
( ~ theorem(implies(sP1_iProver_def,sP0_iProver_def))
| theorem(or(sP2_iProver_def,not(implies(sP0_iProver_def,sP1_iProver_def)))) ),
inference(superposition,[status(thm)],[c_5019,c_59]) ).
cnf(c_7357,plain,
( ~ theorem(implies(sP0_iProver_def,sP1_iProver_def))
| ~ theorem(implies(sP1_iProver_def,sP0_iProver_def))
| theorem(sP2_iProver_def) ),
inference(superposition,[status(thm)],[c_5650,c_4041]) ).
cnf(c_7361,plain,
( ~ theorem(implies(sP0_iProver_def,sP1_iProver_def))
| ~ theorem(implies(sP1_iProver_def,sP0_iProver_def)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_7357,c_191]) ).
cnf(c_57738,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X0,not(not(X1)))) ),
inference(superposition,[status(thm)],[c_3856,c_2498]) ).
cnf(c_59924,plain,
( ~ theorem(or(X0,X1))
| theorem(implies(not(X1),X0)) ),
inference(superposition,[status(thm)],[c_57738,c_422]) ).
cnf(c_60187,plain,
( ~ theorem(or(X0,implies(X1,not(X2))))
| theorem(implies(and(X1,X2),X0)) ),
inference(superposition,[status(thm)],[c_105,c_59924]) ).
cnf(c_119296,plain,
theorem(implies(and(implies(X0,X1),implies(X1,X0)),equivalent(X1,X0))),
inference(superposition,[status(thm)],[c_573,c_60187]) ).
cnf(c_119498,plain,
theorem(implies(equivalent(X0,X1),equivalent(X1,X0))),
inference(light_normalisation,[status(thm)],[c_119296,c_50]) ).
cnf(c_119831,plain,
theorem(implies(equivalent(q,p),sP0_iProver_def)),
inference(superposition,[status(thm)],[c_188,c_119498]) ).
cnf(c_119832,plain,
theorem(implies(equivalent(p,q),sP1_iProver_def)),
inference(superposition,[status(thm)],[c_189,c_119498]) ).
cnf(c_119850,plain,
theorem(implies(sP0_iProver_def,sP1_iProver_def)),
inference(light_normalisation,[status(thm)],[c_119832,c_188]) ).
cnf(c_119851,plain,
theorem(implies(sP1_iProver_def,sP0_iProver_def)),
inference(light_normalisation,[status(thm)],[c_119831,c_189]) ).
cnf(c_119883,plain,
~ theorem(implies(sP1_iProver_def,sP0_iProver_def)),
inference(backward_subsumption_resolution,[status(thm)],[c_7361,c_119850]) ).
cnf(c_119884,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_119883,c_119851]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL269-3 : TPTP v8.1.2. Released v2.3.0.
% 0.08/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n018.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 19:17:16 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 42.33/6.76 % SZS status Started for theBenchmark.p
% 42.33/6.76 % SZS status Unsatisfiable for theBenchmark.p
% 42.33/6.76
% 42.33/6.76 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 42.33/6.76
% 42.33/6.76 ------ iProver source info
% 42.33/6.76
% 42.33/6.76 git: date: 2024-05-02 19:28:25 +0000
% 42.33/6.76 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 42.33/6.76 git: non_committed_changes: false
% 42.33/6.76
% 42.33/6.76 ------ Parsing...successful
% 42.33/6.76
% 42.33/6.76
% 42.33/6.76
% 42.33/6.76 ------ 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
% 42.33/6.76
% 42.33/6.76 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 42.33/6.76
% 42.33/6.76 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 42.33/6.76 ------ Proving...
% 42.33/6.76 ------ Problem Properties
% 42.33/6.76
% 42.33/6.76
% 42.33/6.76 clauses 13
% 42.33/6.76 conjectures 1
% 42.33/6.76 EPR 1
% 42.33/6.76 Horn 13
% 42.33/6.76 unary 12
% 42.33/6.76 binary 0
% 42.33/6.76 lits 15
% 42.33/6.76 lits eq 6
% 42.33/6.76 fd_pure 0
% 42.33/6.76 fd_pseudo 0
% 42.33/6.76 fd_cond 0
% 42.33/6.76 fd_pseudo_cond 0
% 42.33/6.76 AC symbols 0
% 42.33/6.76
% 42.33/6.76 ------ Schedule dynamic 5 is on
% 42.33/6.76
% 42.33/6.76 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 42.33/6.76
% 42.33/6.76
% 42.33/6.76 ------
% 42.33/6.76 Current options:
% 42.33/6.76 ------
% 42.33/6.76
% 42.33/6.76
% 42.33/6.76
% 42.33/6.76
% 42.33/6.76 ------ Proving...
% 42.33/6.76
% 42.33/6.76
% 42.33/6.76 % SZS status Unsatisfiable for theBenchmark.p
% 42.33/6.76
% 42.33/6.76 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 42.33/6.76
% 42.33/6.76
%------------------------------------------------------------------------------