TSTP Solution File: LCL201-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL201-1 : TPTP v8.2.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.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 : Mon Jun 24 11:04:40 EDT 2024
% Result : Unsatisfiable 110.74s 15.29s
% Output : CNFRefutation 110.74s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(or(not(not(or(p,q))),or(not(p),q))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_51,plain,
axiom(or(not(X0),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_3) ).
cnf(c_52,plain,
axiom(or(not(or(X0,X1)),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_4) ).
cnf(c_53,plain,
axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).
cnf(c_55,plain,
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_1) ).
cnf(c_56,plain,
( ~ axiom(or(not(X0),X1))
| ~ theorem(X0)
| theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_2) ).
cnf(c_57,plain,
( ~ theorem(or(not(X0),X1))
| ~ axiom(or(not(X2),X0))
| theorem(or(not(X2),X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_3) ).
cnf(c_216,plain,
or(p,q) = sP0_iProver_def,
definition ).
cnf(c_217,plain,
not(sP0_iProver_def) = sP1_iProver_def,
definition ).
cnf(c_218,plain,
not(sP1_iProver_def) = sP2_iProver_def,
definition ).
cnf(c_219,plain,
not(p) = sP3_iProver_def,
definition ).
cnf(c_220,plain,
or(sP3_iProver_def,q) = sP4_iProver_def,
definition ).
cnf(c_221,plain,
or(sP2_iProver_def,sP4_iProver_def) = sP5_iProver_def,
definition ).
cnf(c_222,negated_conjecture,
~ theorem(sP5_iProver_def),
inference(demodulation,[status(thm)],[c_49,c_219,c_220,c_216,c_217,c_218,c_221]) ).
cnf(c_430,plain,
axiom(or(not(or(q,p)),sP0_iProver_def)),
inference(superposition,[status(thm)],[c_216,c_52]) ).
cnf(c_433,plain,
theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(superposition,[status(thm)],[c_52,c_55]) ).
cnf(c_256352,plain,
axiom(or(not(or(sP3_iProver_def,or(X0,q))),or(X0,sP4_iProver_def))),
inference(superposition,[status(thm)],[c_220,c_53]) ).
cnf(c_256355,plain,
( ~ theorem(or(X0,or(X1,X2)))
| theorem(or(X1,or(X0,X2))) ),
inference(superposition,[status(thm)],[c_53,c_56]) ).
cnf(c_256393,plain,
( ~ axiom(or(not(X0),or(X1,X2)))
| theorem(or(not(X0),or(X2,X1))) ),
inference(superposition,[status(thm)],[c_433,c_57]) ).
cnf(c_256570,plain,
axiom(or(not(or(sP3_iProver_def,or(sP2_iProver_def,q))),sP5_iProver_def)),
inference(superposition,[status(thm)],[c_221,c_256352]) ).
cnf(c_256574,plain,
( ~ theorem(or(sP3_iProver_def,or(sP2_iProver_def,q)))
| theorem(sP5_iProver_def) ),
inference(superposition,[status(thm)],[c_256570,c_56]) ).
cnf(c_256575,plain,
~ theorem(or(sP3_iProver_def,or(sP2_iProver_def,q))),
inference(forward_subsumption_resolution,[status(thm)],[c_256574,c_222]) ).
cnf(c_264263,plain,
theorem(or(not(X0),or(X0,X1))),
inference(superposition,[status(thm)],[c_51,c_256393]) ).
cnf(c_264316,plain,
theorem(or(X0,or(not(X0),X1))),
inference(superposition,[status(thm)],[c_264263,c_256355]) ).
cnf(c_264445,plain,
( ~ axiom(or(not(X0),X1))
| theorem(or(not(X0),or(not(not(X1)),X2))) ),
inference(superposition,[status(thm)],[c_264316,c_57]) ).
cnf(c_278613,plain,
( ~ axiom(or(not(X0),sP0_iProver_def))
| theorem(or(not(X0),or(not(sP1_iProver_def),X1))) ),
inference(superposition,[status(thm)],[c_217,c_264445]) ).
cnf(c_278968,plain,
( ~ axiom(or(not(X0),sP0_iProver_def))
| theorem(or(not(X0),or(sP2_iProver_def,X1))) ),
inference(light_normalisation,[status(thm)],[c_278613,c_218]) ).
cnf(c_278977,plain,
( ~ axiom(or(not(X0),X1))
| ~ axiom(or(not(X1),sP0_iProver_def))
| theorem(or(not(X0),or(sP2_iProver_def,X2))) ),
inference(superposition,[status(thm)],[c_278968,c_57]) ).
cnf(c_280877,plain,
( ~ axiom(or(not(or(X0,X1)),sP0_iProver_def))
| theorem(or(not(X1),or(sP2_iProver_def,X2))) ),
inference(superposition,[status(thm)],[c_51,c_278977]) ).
cnf(c_291387,plain,
theorem(or(not(p),or(sP2_iProver_def,X0))),
inference(superposition,[status(thm)],[c_430,c_280877]) ).
cnf(c_291422,plain,
theorem(or(sP3_iProver_def,or(sP2_iProver_def,X0))),
inference(light_normalisation,[status(thm)],[c_291387,c_219]) ).
cnf(c_291423,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_256575,c_291422]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL201-1 : TPTP v8.2.0. Released v1.1.0.
% 0.07/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sat Jun 22 14:32:39 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 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
% 110.74/15.29 % SZS status Started for theBenchmark.p
% 110.74/15.29 % SZS status Unsatisfiable for theBenchmark.p
% 110.74/15.29
% 110.74/15.29 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 110.74/15.29
% 110.74/15.29 ------ iProver source info
% 110.74/15.29
% 110.74/15.29 git: date: 2024-06-12 09:56:46 +0000
% 110.74/15.29 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 110.74/15.29 git: non_committed_changes: false
% 110.74/15.29
% 110.74/15.29 ------ Parsing...successful
% 110.74/15.29
% 110.74/15.29
% 110.74/15.29
% 110.74/15.29 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 110.74/15.29
% 110.74/15.29 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 110.74/15.29
% 110.74/15.29 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 110.74/15.29 ------ Proving...
% 110.74/15.29 ------ Problem Properties
% 110.74/15.29
% 110.74/15.29
% 110.74/15.29 clauses 15
% 110.74/15.29 conjectures 1
% 110.74/15.29 EPR 2
% 110.74/15.29 Horn 15
% 110.74/15.29 unary 12
% 110.74/15.29 binary 1
% 110.74/15.29 lits 20
% 110.74/15.29 lits eq 6
% 110.74/15.29 fd_pure 0
% 110.74/15.29 fd_pseudo 0
% 110.74/15.29 fd_cond 0
% 110.74/15.29 fd_pseudo_cond 0
% 110.74/15.29 AC symbols 0
% 110.74/15.29
% 110.74/15.29 ------ Input Options Time Limit: Unbounded
% 110.74/15.29
% 110.74/15.29
% 110.74/15.29 ------
% 110.74/15.29 Current options:
% 110.74/15.29 ------
% 110.74/15.29
% 110.74/15.29
% 110.74/15.29
% 110.74/15.29
% 110.74/15.29 ------ Proving...
% 110.74/15.29
% 110.74/15.29
% 110.74/15.29 % SZS status Unsatisfiable for theBenchmark.p
% 110.74/15.29
% 110.74/15.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 110.74/15.29
% 110.74/15.29
%------------------------------------------------------------------------------