TSTP Solution File: LCL218-10 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL218-10 : TPTP v8.2.0. Released v7.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 : Mon Jun 24 11:04:48 EDT 2024
% Result : Unsatisfiable 19.24s 3.16s
% Output : CNFRefutation 19.24s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
ifeq(X0,X0,X1,X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(c_50,plain,
axiom(or(not(or(X0,X0)),X0)) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_2) ).
cnf(c_51,plain,
axiom(or(not(X0),or(X1,X0))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_3) ).
cnf(c_52,plain,
axiom(or(not(or(X0,X1)),or(X1,X0))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_4) ).
cnf(c_53,plain,
axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_5) ).
cnf(c_55,plain,
ifeq(axiom(X0),true,theorem(X0),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).
cnf(c_56,plain,
ifeq(theorem(X0),true,ifeq(axiom(or(not(X0),X1)),true,theorem(X1),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_2) ).
cnf(c_57,plain,
ifeq(theorem(or(not(X0),X1)),true,ifeq(axiom(or(not(X2),X0)),true,theorem(or(not(X2),X1)),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_3) ).
cnf(c_58,negated_conjecture,
theorem(or(not(or(not(or(p,q)),q)),or(not(p),q))) != true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_95,plain,
or(p,q) = sP0_iProver_def,
definition ).
cnf(c_96,plain,
not(sP0_iProver_def) = sP1_iProver_def,
definition ).
cnf(c_97,plain,
or(sP1_iProver_def,q) = sP2_iProver_def,
definition ).
cnf(c_98,plain,
not(sP2_iProver_def) = sP3_iProver_def,
definition ).
cnf(c_99,plain,
not(p) = sP4_iProver_def,
definition ).
cnf(c_100,plain,
or(sP4_iProver_def,q) = sP5_iProver_def,
definition ).
cnf(c_101,plain,
or(sP3_iProver_def,sP5_iProver_def) = sP6_iProver_def,
definition ).
cnf(c_102,plain,
theorem(sP6_iProver_def) = sP7_iProver_def,
definition ).
cnf(c_103,negated_conjecture,
sP7_iProver_def != true,
inference(demodulation,[status(thm)],[c_58,c_99,c_100,c_95,c_96,c_97,c_98,c_101,c_102]) ).
cnf(c_191,plain,
axiom(or(sP3_iProver_def,or(X0,sP2_iProver_def))) = true,
inference(superposition,[status(thm)],[c_98,c_51]) ).
cnf(c_200,plain,
axiom(or(not(or(q,p)),sP0_iProver_def)) = true,
inference(superposition,[status(thm)],[c_95,c_52]) ).
cnf(c_207,plain,
axiom(or(not(or(X0,sP2_iProver_def)),or(sP1_iProver_def,or(X0,q)))) = true,
inference(superposition,[status(thm)],[c_97,c_53]) ).
cnf(c_212,plain,
axiom(or(not(or(sP4_iProver_def,or(X0,q))),or(X0,sP5_iProver_def))) = true,
inference(superposition,[status(thm)],[c_100,c_53]) ).
cnf(c_249,plain,
ifeq(theorem(or(X0,X0)),true,ifeq(true,true,theorem(X0),true),true) = true,
inference(superposition,[status(thm)],[c_50,c_56]) ).
cnf(c_252,plain,
ifeq(theorem(or(X0,or(X1,X2))),true,ifeq(true,true,theorem(or(X1,or(X0,X2))),true),true) = true,
inference(superposition,[status(thm)],[c_53,c_56]) ).
cnf(c_269,plain,
ifeq(theorem(or(X0,X0)),true,theorem(X0),true) = true,
inference(demodulation,[status(thm)],[c_249,c_49]) ).
cnf(c_271,plain,
ifeq(theorem(or(X0,or(X1,X2))),true,theorem(or(X1,or(X0,X2))),true) = true,
inference(demodulation,[status(thm)],[c_252,c_49]) ).
cnf(c_354,plain,
ifeq(theorem(or(not(or(X0,X1)),X2)),true,ifeq(true,true,theorem(or(not(X1),X2)),true),true) = true,
inference(superposition,[status(thm)],[c_51,c_57]) ).
cnf(c_364,plain,
ifeq(theorem(or(not(sP0_iProver_def),X0)),true,ifeq(true,true,theorem(or(not(or(q,p)),X0)),true),true) = true,
inference(superposition,[status(thm)],[c_200,c_57]) ).
cnf(c_392,plain,
ifeq(theorem(or(sP1_iProver_def,X0)),true,theorem(or(not(or(q,p)),X0)),true) = true,
inference(demodulation,[status(thm)],[c_364,c_49,c_96]) ).
cnf(c_395,plain,
ifeq(theorem(or(not(or(X0,X1)),X2)),true,theorem(or(not(X1),X2)),true) = true,
inference(demodulation,[status(thm)],[c_354,c_49]) ).
cnf(c_418,plain,
ifeq(true,true,theorem(or(sP3_iProver_def,or(X0,sP2_iProver_def))),true) = true,
inference(superposition,[status(thm)],[c_191,c_55]) ).
cnf(c_419,plain,
theorem(or(sP3_iProver_def,or(X0,sP2_iProver_def))) = true,
inference(demodulation,[status(thm)],[c_418,c_49]) ).
cnf(c_525,plain,
ifeq(theorem(or(X0,sP2_iProver_def)),true,ifeq(true,true,theorem(or(sP1_iProver_def,or(X0,q))),true),true) = true,
inference(superposition,[status(thm)],[c_207,c_56]) ).
cnf(c_528,plain,
ifeq(theorem(or(X0,sP2_iProver_def)),true,theorem(or(sP1_iProver_def,or(X0,q))),true) = true,
inference(demodulation,[status(thm)],[c_525,c_49]) ).
cnf(c_752,plain,
axiom(or(not(or(sP4_iProver_def,or(sP3_iProver_def,q))),sP6_iProver_def)) = true,
inference(superposition,[status(thm)],[c_101,c_212]) ).
cnf(c_961,plain,
ifeq(theorem(or(sP4_iProver_def,or(sP3_iProver_def,q))),true,ifeq(true,true,theorem(sP6_iProver_def),true),true) = true,
inference(superposition,[status(thm)],[c_752,c_56]) ).
cnf(c_964,plain,
ifeq(theorem(or(sP4_iProver_def,or(sP3_iProver_def,q))),true,sP7_iProver_def,true) = true,
inference(demodulation,[status(thm)],[c_961,c_49,c_102]) ).
cnf(c_2244,plain,
ifeq(true,true,theorem(or(X0,or(sP3_iProver_def,sP2_iProver_def))),true) = true,
inference(superposition,[status(thm)],[c_419,c_271]) ).
cnf(c_2333,plain,
theorem(or(X0,or(sP3_iProver_def,sP2_iProver_def))) = true,
inference(demodulation,[status(thm)],[c_2244,c_49]) ).
cnf(c_3369,plain,
ifeq(true,true,theorem(or(sP3_iProver_def,sP2_iProver_def)),true) = true,
inference(superposition,[status(thm)],[c_2333,c_269]) ).
cnf(c_3376,plain,
theorem(or(sP3_iProver_def,sP2_iProver_def)) = true,
inference(demodulation,[status(thm)],[c_3369,c_49]) ).
cnf(c_13083,plain,
ifeq(true,true,theorem(or(sP1_iProver_def,or(sP3_iProver_def,q))),true) = true,
inference(superposition,[status(thm)],[c_3376,c_528]) ).
cnf(c_13098,plain,
theorem(or(sP1_iProver_def,or(sP3_iProver_def,q))) = true,
inference(demodulation,[status(thm)],[c_13083,c_49]) ).
cnf(c_17312,plain,
ifeq(true,true,theorem(or(not(or(q,p)),or(sP3_iProver_def,q))),true) = true,
inference(superposition,[status(thm)],[c_13098,c_392]) ).
cnf(c_17322,plain,
theorem(or(not(or(q,p)),or(sP3_iProver_def,q))) = true,
inference(demodulation,[status(thm)],[c_17312,c_49]) ).
cnf(c_39805,plain,
ifeq(true,true,theorem(or(not(p),or(sP3_iProver_def,q))),true) = true,
inference(superposition,[status(thm)],[c_17322,c_395]) ).
cnf(c_39812,plain,
theorem(or(sP4_iProver_def,or(sP3_iProver_def,q))) = true,
inference(demodulation,[status(thm)],[c_39805,c_49,c_99]) ).
cnf(c_39826,plain,
ifeq(true,true,sP7_iProver_def,true) = true,
inference(demodulation,[status(thm)],[c_964,c_39812]) ).
cnf(c_39828,plain,
true = sP7_iProver_def,
inference(demodulation,[status(thm)],[c_39826,c_49]) ).
cnf(c_40907,plain,
sP7_iProver_def != sP7_iProver_def,
inference(demodulation,[status(thm)],[c_103,c_39828]) ).
cnf(c_40908,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_40907]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL218-10 : TPTP v8.2.0. Released v7.3.0.
% 0.10/0.12 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n023.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sat Jun 22 17:57:09 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.21/0.48 Running UEQ theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule casc_j12_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 19.24/3.16 % SZS status Started for theBenchmark.p
% 19.24/3.16 % SZS status Unsatisfiable for theBenchmark.p
% 19.24/3.16
% 19.24/3.16 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 19.24/3.16
% 19.24/3.16 ------ iProver source info
% 19.24/3.16
% 19.24/3.16 git: date: 2024-06-12 09:56:46 +0000
% 19.24/3.16 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 19.24/3.16 git: non_committed_changes: false
% 19.24/3.16
% 19.24/3.16 ------ Parsing...successful
% 19.24/3.16
% 19.24/3.16
% 19.24/3.16
% 19.24/3.16 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 19.24/3.16
% 19.24/3.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 19.24/3.16
% 19.24/3.16 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 19.24/3.16 ------ Proving...
% 19.24/3.16 ------ Problem Properties
% 19.24/3.16
% 19.24/3.16
% 19.24/3.16 clauses 18
% 19.24/3.16 conjectures 1
% 19.24/3.16 EPR 1
% 19.24/3.16 Horn 18
% 19.24/3.16 unary 18
% 19.24/3.16 binary 0
% 19.24/3.16 lits 18
% 19.24/3.16 lits eq 18
% 19.24/3.16 fd_pure 0
% 19.24/3.16 fd_pseudo 0
% 19.24/3.16 fd_cond 0
% 19.24/3.16 fd_pseudo_cond 0
% 19.24/3.16 AC symbols 0
% 19.24/3.16
% 19.24/3.16 ------ Input Options Time Limit: Unbounded
% 19.24/3.16
% 19.24/3.16
% 19.24/3.16 ------
% 19.24/3.16 Current options:
% 19.24/3.16 ------
% 19.24/3.16
% 19.24/3.16
% 19.24/3.16
% 19.24/3.16
% 19.24/3.16 ------ Proving...
% 19.24/3.16
% 19.24/3.16
% 19.24/3.16 % SZS status Unsatisfiable for theBenchmark.p
% 19.24/3.16
% 19.24/3.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 19.24/3.16
% 19.24/3.16
%------------------------------------------------------------------------------