TSTP Solution File: LCL186-10 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL186-10 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n022.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:08 EDT 2024
% Result : Unsatisfiable 4.15s 1.23s
% Output : CNFRefutation 4.15s
% 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_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_55,plain,
ifeq(axiom(X0),true,theorem(X0),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).
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(not(p)),or(not(p),q))) != true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_95,plain,
not(p) = sP0_iProver_def,
definition ).
cnf(c_96,plain,
not(sP0_iProver_def) = sP1_iProver_def,
definition ).
cnf(c_97,plain,
or(sP0_iProver_def,q) = sP2_iProver_def,
definition ).
cnf(c_98,plain,
or(sP1_iProver_def,sP2_iProver_def) = sP3_iProver_def,
definition ).
cnf(c_99,plain,
theorem(sP3_iProver_def) = sP4_iProver_def,
definition ).
cnf(c_100,negated_conjecture,
sP4_iProver_def != true,
inference(demodulation,[status(thm)],[c_58,c_97,c_95,c_96,c_98,c_99]) ).
cnf(c_1913,plain,
ifeq(true,true,theorem(or(not(or(X0,X1)),or(X1,X0))),true) = true,
inference(superposition,[status(thm)],[c_52,c_55]) ).
cnf(c_1923,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_1959,plain,
theorem(or(not(or(X0,X1)),or(X1,X0))) = true,
inference(demodulation,[status(thm)],[c_1913,c_49]) ).
cnf(c_1962,plain,
ifeq(theorem(or(not(or(X0,X1)),X2)),true,theorem(or(not(X1),X2)),true) = true,
inference(demodulation,[status(thm)],[c_1923,c_49]) ).
cnf(c_2179,plain,
ifeq(true,true,theorem(or(not(X0),or(X0,X1))),true) = true,
inference(superposition,[status(thm)],[c_1959,c_1962]) ).
cnf(c_2311,plain,
theorem(or(not(X0),or(X0,X1))) = true,
inference(demodulation,[status(thm)],[c_2179,c_49]) ).
cnf(c_2958,plain,
theorem(or(not(sP0_iProver_def),sP2_iProver_def)) = true,
inference(superposition,[status(thm)],[c_97,c_2311]) ).
cnf(c_2999,plain,
true = sP4_iProver_def,
inference(demodulation,[status(thm)],[c_2958,c_96,c_98,c_99]) ).
cnf(c_4762,plain,
$false,
inference(superposition,[status(thm)],[c_2999,c_100]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL186-10 : TPTP v8.1.2. Released v7.5.0.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu May 2 19:06:27 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running UEQ theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule casc_24_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.15/1.23 % SZS status Started for theBenchmark.p
% 4.15/1.23 % SZS status Unsatisfiable for theBenchmark.p
% 4.15/1.23
% 4.15/1.23 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.15/1.23
% 4.15/1.23 ------ iProver source info
% 4.15/1.23
% 4.15/1.23 git: date: 2024-05-02 19:28:25 +0000
% 4.15/1.23 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 4.15/1.23 git: non_committed_changes: false
% 4.15/1.23
% 4.15/1.23 ------ Parsing...successful
% 4.15/1.23
% 4.15/1.23
% 4.15/1.23
% 4.15/1.23 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 4.15/1.23
% 4.15/1.23 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.15/1.23
% 4.15/1.23 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 4.15/1.23 ------ Proving...
% 4.15/1.23 ------ Problem Properties
% 4.15/1.23
% 4.15/1.23
% 4.15/1.23 clauses 15
% 4.15/1.23 conjectures 1
% 4.15/1.23 EPR 1
% 4.15/1.23 Horn 15
% 4.15/1.23 unary 15
% 4.15/1.23 binary 0
% 4.15/1.23 lits 15
% 4.15/1.23 lits eq 15
% 4.15/1.23 fd_pure 0
% 4.15/1.23 fd_pseudo 0
% 4.15/1.23 fd_cond 0
% 4.15/1.23 fd_pseudo_cond 0
% 4.15/1.23 AC symbols 0
% 4.15/1.23
% 4.15/1.23 ------ Input Options Time Limit: Unbounded
% 4.15/1.23
% 4.15/1.23
% 4.15/1.23 ------
% 4.15/1.23 Current options:
% 4.15/1.23 ------
% 4.15/1.23
% 4.15/1.23
% 4.15/1.23
% 4.15/1.23
% 4.15/1.23 ------ Proving...
% 4.15/1.23
% 4.15/1.23
% 4.15/1.23 % SZS status Unsatisfiable for theBenchmark.p
% 4.15/1.23
% 4.15/1.23 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.15/1.23
% 4.15/1.23
%------------------------------------------------------------------------------