TSTP Solution File: LCL228-3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL228-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 : Thu Aug 31 07:43:21 EDT 2023
% Result : Satisfiable 223.62s 30.29s
% Output : Saturation 223.62s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(implies(or(or(p,q),r),implies(or(or(p,not(r)),s),or(or(p,q),s)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_50,plain,
axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
cnf(c_51,plain,
axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(c_52,plain,
axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
cnf(c_53,plain,
axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
cnf(c_54,plain,
axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
cnf(c_55,plain,
or(not(X0),X1) = implies(X0,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(c_56,plain,
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_1) ).
cnf(c_57,plain,
( ~ theorem(implies(X0,X1))
| ~ theorem(X0)
| theorem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(c_96,plain,
( X0 != X1
| ~ axiom(X1)
| axiom(X0) ),
theory(equality) ).
cnf(c_97,plain,
( implies(or(X0,X0),X0) != X1
| theorem(X1) ),
inference(resolution_lifted,[status(thm)],[c_50,c_56]) ).
cnf(c_98,plain,
theorem(implies(or(X0,X0),X0)),
inference(unflattening,[status(thm)],[c_97]) ).
cnf(c_103,plain,
( implies(X0,or(X1,X0)) != X2
| theorem(X2) ),
inference(resolution_lifted,[status(thm)],[c_51,c_56]) ).
cnf(c_104,plain,
theorem(implies(X0,or(X1,X0))),
inference(unflattening,[status(thm)],[c_103]) ).
cnf(c_109,plain,
( implies(or(X0,X1),or(X1,X0)) != X2
| theorem(X2) ),
inference(resolution_lifted,[status(thm)],[c_52,c_56]) ).
cnf(c_110,plain,
theorem(implies(or(X0,X1),or(X1,X0))),
inference(unflattening,[status(thm)],[c_109]) ).
cnf(c_115,plain,
( implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))) != X3
| theorem(X3) ),
inference(resolution_lifted,[status(thm)],[c_53,c_56]) ).
cnf(c_116,plain,
theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(unflattening,[status(thm)],[c_115]) ).
cnf(c_121,plain,
( implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1))) != X3
| theorem(X3) ),
inference(resolution_lifted,[status(thm)],[c_54,c_56]) ).
cnf(c_122,plain,
theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(unflattening,[status(thm)],[c_121]) ).
cnf(c_160,plain,
X0_1 = X0_1,
theory(equality) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL228-3 : TPTP v8.1.2. Released v2.3.0.
% 0.00/0.11 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n018.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Fri Aug 25 07:23:28 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 223.62/30.29 % SZS status Started for theBenchmark.p
% 223.62/30.29 % SZS status Satisfiable for theBenchmark.p
% 223.62/30.29
% 223.62/30.29 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 223.62/30.29
% 223.62/30.29 ------ iProver source info
% 223.62/30.29
% 223.62/30.29 git: date: 2023-05-31 18:12:56 +0000
% 223.62/30.29 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 223.62/30.29 git: non_committed_changes: false
% 223.62/30.29 git: last_make_outside_of_git: false
% 223.62/30.29
% 223.62/30.29 ------ Parsing...successful
% 223.62/30.29
% 223.62/30.29
% 223.62/30.29
% 223.62/30.29 ------ Preprocessing... sup_sim: 0 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
% 223.62/30.29
% 223.62/30.29 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 223.62/30.29
% 223.62/30.29 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 223.62/30.29 ------ Proving...
% 223.62/30.29 ------ Problem Properties
% 223.62/30.29
% 223.62/30.29
% 223.62/30.29 clauses 8
% 223.62/30.29 conjectures 1
% 223.62/30.29 EPR 0
% 223.62/30.29 Horn 8
% 223.62/30.29 unary 7
% 223.62/30.29 binary 0
% 223.62/30.29 lits 10
% 223.62/30.29 lits eq 1
% 223.62/30.29 fd_pure 0
% 223.62/30.29 fd_pseudo 0
% 223.62/30.29 fd_cond 0
% 223.62/30.29 fd_pseudo_cond 0
% 223.62/30.29 AC symbols 0
% 223.62/30.29
% 223.62/30.29 ------ Input Options Time Limit: Unbounded
% 223.62/30.29
% 223.62/30.29
% 223.62/30.29 ------
% 223.62/30.29 Current options:
% 223.62/30.29 ------
% 223.62/30.29
% 223.62/30.29
% 223.62/30.29
% 223.62/30.29
% 223.62/30.29 ------ Proving...
% 223.62/30.29
% 223.62/30.29
% 223.62/30.29 % SZS status Satisfiable for theBenchmark.p
% 223.62/30.29
% 223.62/30.29 % SZS output start Saturation for theBenchmark.p
% See solution above
% 223.62/30.29
% 223.62/30.29
%------------------------------------------------------------------------------