TSTP Solution File: LCL265-3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL265-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 : Fri May 3 02:37:31 EDT 2024
% Result : Unsatisfiable 18.02s 3.13s
% Output : CNFRefutation 18.06s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(equivalent(p,not(not(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,
not(p) = sP0_iProver_def,
definition ).
cnf(c_189,plain,
not(sP0_iProver_def) = sP1_iProver_def,
definition ).
cnf(c_190,plain,
equivalent(p,sP1_iProver_def) = sP2_iProver_def,
definition ).
cnf(c_191,negated_conjecture,
~ theorem(sP2_iProver_def),
inference(demodulation,[status(thm)],[c_49,c_188,c_189,c_190]) ).
cnf(c_354,plain,
implies(p,X0) = or(sP0_iProver_def,X0),
inference(superposition,[status(thm)],[c_188,c_57]) ).
cnf(c_355,plain,
implies(sP0_iProver_def,X0) = or(sP1_iProver_def,X0),
inference(superposition,[status(thm)],[c_189,c_57]) ).
cnf(c_357,plain,
theorem(implies(or(X0,not(X1)),implies(X1,X0))),
inference(superposition,[status(thm)],[c_57,c_130]) ).
cnf(c_366,plain,
theorem(implies(implies(X0,or(X1,X2)),or(X1,or(not(X0),X2)))),
inference(superposition,[status(thm)],[c_57,c_136]) ).
cnf(c_377,plain,
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(superposition,[status(thm)],[c_118,c_59]) ).
cnf(c_379,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_130,c_59]) ).
cnf(c_380,plain,
( ~ theorem(or(X0,or(X1,X2)))
| theorem(or(X1,or(X0,X2))) ),
inference(superposition,[status(thm)],[c_136,c_59]) ).
cnf(c_393,plain,
not(implies(X0,sP1_iProver_def)) = and(X0,sP0_iProver_def),
inference(superposition,[status(thm)],[c_189,c_105]) ).
cnf(c_423,plain,
and(or(sP0_iProver_def,X0),implies(X0,p)) = equivalent(p,X0),
inference(superposition,[status(thm)],[c_354,c_50]) ).
cnf(c_428,plain,
theorem(or(sP0_iProver_def,or(X0,p))),
inference(superposition,[status(thm)],[c_354,c_124]) ).
cnf(c_461,plain,
theorem(or(sP1_iProver_def,or(X0,sP0_iProver_def))),
inference(superposition,[status(thm)],[c_355,c_124]) ).
cnf(c_496,plain,
theorem(implies(or(sP1_iProver_def,X0),implies(or(X1,sP0_iProver_def),or(X1,X0)))),
inference(superposition,[status(thm)],[c_355,c_142]) ).
cnf(c_526,plain,
( ~ theorem(or(X0,not(X1)))
| theorem(implies(X1,X0)) ),
inference(superposition,[status(thm)],[c_357,c_59]) ).
cnf(c_658,plain,
theorem(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))),
inference(demodulation,[status(thm)],[c_366,c_57]) ).
cnf(c_665,plain,
( ~ theorem(implies(X0,or(X1,X2)))
| theorem(or(X1,implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_658,c_59]) ).
cnf(c_712,plain,
not(or(sP0_iProver_def,sP1_iProver_def)) = and(p,sP0_iProver_def),
inference(superposition,[status(thm)],[c_354,c_393]) ).
cnf(c_1050,plain,
implies(or(sP0_iProver_def,sP1_iProver_def),X0) = or(and(p,sP0_iProver_def),X0),
inference(superposition,[status(thm)],[c_712,c_57]) ).
cnf(c_1416,plain,
( ~ theorem(implies(X0,not(X1)))
| theorem(implies(X1,not(X0))) ),
inference(superposition,[status(thm)],[c_57,c_526]) ).
cnf(c_1660,plain,
theorem(or(X0,or(sP0_iProver_def,p))),
inference(superposition,[status(thm)],[c_428,c_380]) ).
cnf(c_1661,plain,
theorem(or(X0,or(sP1_iProver_def,sP0_iProver_def))),
inference(superposition,[status(thm)],[c_461,c_380]) ).
cnf(c_1836,plain,
theorem(or(sP0_iProver_def,p)),
inference(superposition,[status(thm)],[c_1660,c_377]) ).
cnf(c_1844,plain,
theorem(or(p,sP0_iProver_def)),
inference(superposition,[status(thm)],[c_1836,c_379]) ).
cnf(c_1848,plain,
theorem(or(sP1_iProver_def,sP0_iProver_def)),
inference(superposition,[status(thm)],[c_1661,c_377]) ).
cnf(c_1856,plain,
theorem(or(sP0_iProver_def,sP1_iProver_def)),
inference(superposition,[status(thm)],[c_1848,c_379]) ).
cnf(c_2485,plain,
( ~ theorem(or(sP1_iProver_def,X0))
| theorem(implies(or(X1,sP0_iProver_def),or(X1,X0))) ),
inference(superposition,[status(thm)],[c_496,c_59]) ).
cnf(c_5677,plain,
( ~ theorem(or(and(p,sP0_iProver_def),X0))
| ~ theorem(or(sP0_iProver_def,sP1_iProver_def))
| theorem(X0) ),
inference(superposition,[status(thm)],[c_1050,c_59]) ).
cnf(c_5688,plain,
not(or(and(p,sP0_iProver_def),not(X0))) = and(or(sP0_iProver_def,sP1_iProver_def),X0),
inference(superposition,[status(thm)],[c_1050,c_105]) ).
cnf(c_5777,plain,
( ~ theorem(or(and(p,sP0_iProver_def),X0))
| theorem(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_5677,c_1856]) ).
cnf(c_8685,plain,
theorem(or(X0,implies(X1,X1))),
inference(superposition,[status(thm)],[c_124,c_665]) ).
cnf(c_9215,plain,
theorem(implies(X0,X0)),
inference(superposition,[status(thm)],[c_8685,c_5777]) ).
cnf(c_9237,plain,
theorem(or(X0,implies(or(X0,X1),X1))),
inference(superposition,[status(thm)],[c_9215,c_665]) ).
cnf(c_9238,plain,
theorem(implies(X0,not(not(X0)))),
inference(superposition,[status(thm)],[c_9215,c_1416]) ).
cnf(c_9347,plain,
theorem(or(sP1_iProver_def,not(not(sP0_iProver_def)))),
inference(superposition,[status(thm)],[c_355,c_9238]) ).
cnf(c_9373,plain,
theorem(or(sP1_iProver_def,not(sP1_iProver_def))),
inference(light_normalisation,[status(thm)],[c_9347,c_189]) ).
cnf(c_10031,plain,
theorem(implies(or(and(p,sP0_iProver_def),X0),X0)),
inference(superposition,[status(thm)],[c_9237,c_5777]) ).
cnf(c_10726,plain,
theorem(implies(X0,not(or(and(p,sP0_iProver_def),not(X0))))),
inference(superposition,[status(thm)],[c_10031,c_1416]) ).
cnf(c_10731,plain,
theorem(implies(X0,and(or(sP0_iProver_def,sP1_iProver_def),X0))),
inference(light_normalisation,[status(thm)],[c_10726,c_5688]) ).
cnf(c_10952,plain,
theorem(implies(implies(sP1_iProver_def,p),equivalent(p,sP1_iProver_def))),
inference(superposition,[status(thm)],[c_423,c_10731]) ).
cnf(c_10956,plain,
theorem(implies(implies(sP1_iProver_def,p),sP2_iProver_def)),
inference(light_normalisation,[status(thm)],[c_10952,c_190]) ).
cnf(c_11000,plain,
( ~ theorem(implies(sP1_iProver_def,p))
| theorem(sP2_iProver_def) ),
inference(superposition,[status(thm)],[c_10956,c_59]) ).
cnf(c_11001,plain,
~ theorem(implies(sP1_iProver_def,p)),
inference(forward_subsumption_resolution,[status(thm)],[c_11000,c_191]) ).
cnf(c_21456,plain,
( ~ theorem(or(X0,sP0_iProver_def))
| ~ theorem(or(sP1_iProver_def,X1))
| theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_2485,c_59]) ).
cnf(c_42618,plain,
( ~ theorem(or(sP1_iProver_def,X0))
| theorem(or(p,X0)) ),
inference(superposition,[status(thm)],[c_1844,c_21456]) ).
cnf(c_43510,plain,
theorem(or(p,not(sP1_iProver_def))),
inference(superposition,[status(thm)],[c_9373,c_42618]) ).
cnf(c_43902,plain,
theorem(implies(sP1_iProver_def,p)),
inference(superposition,[status(thm)],[c_43510,c_526]) ).
cnf(c_43903,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_43902,c_11001]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : LCL265-3 : TPTP v8.1.2. Released v2.3.0.
% 0.03/0.11 % Command : run_iprover %s %d THM
% 0.10/0.32 % Computer : n023.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Thu May 2 19:15:09 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.17/0.42 Running first-order theorem proving
% 0.17/0.42 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
% 18.02/3.13 % SZS status Started for theBenchmark.p
% 18.02/3.13 % SZS status Unsatisfiable for theBenchmark.p
% 18.02/3.13
% 18.02/3.13 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 18.02/3.13
% 18.02/3.13 ------ iProver source info
% 18.02/3.13
% 18.02/3.13 git: date: 2024-05-02 19:28:25 +0000
% 18.02/3.13 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 18.02/3.13 git: non_committed_changes: false
% 18.02/3.13
% 18.02/3.13 ------ Parsing...successful
% 18.02/3.13
% 18.02/3.13
% 18.02/3.13
% 18.02/3.13 ------ 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
% 18.02/3.13
% 18.02/3.13 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 18.02/3.13
% 18.02/3.13 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 18.02/3.13 ------ Proving...
% 18.02/3.13 ------ Problem Properties
% 18.02/3.13
% 18.02/3.13
% 18.02/3.13 clauses 13
% 18.02/3.13 conjectures 1
% 18.02/3.13 EPR 1
% 18.02/3.13 Horn 13
% 18.02/3.13 unary 12
% 18.02/3.13 binary 0
% 18.02/3.13 lits 15
% 18.02/3.13 lits eq 6
% 18.02/3.13 fd_pure 0
% 18.02/3.13 fd_pseudo 0
% 18.02/3.13 fd_cond 0
% 18.02/3.13 fd_pseudo_cond 0
% 18.02/3.13 AC symbols 0
% 18.02/3.13
% 18.02/3.13 ------ Schedule dynamic 5 is on
% 18.02/3.13
% 18.02/3.13 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 18.02/3.13
% 18.02/3.13
% 18.02/3.13 ------
% 18.02/3.13 Current options:
% 18.02/3.13 ------
% 18.02/3.13
% 18.02/3.13
% 18.02/3.13
% 18.02/3.13
% 18.02/3.13 ------ Proving...
% 18.02/3.13
% 18.02/3.13
% 18.02/3.13 % SZS status Unsatisfiable for theBenchmark.p
% 18.02/3.13
% 18.02/3.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 18.06/3.13
% 18.06/3.14
%------------------------------------------------------------------------------