TSTP Solution File: LCL228-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL228-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n005.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 172.10s 23.36s
% Output : Saturation 172.10s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(or(not(or(or(p,q),r)),or(not(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(or(not(or(X0,X0)),X0)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_2) ).
cnf(c_51,plain,
axiom(or(not(X0),or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_3) ).
cnf(c_52,plain,
axiom(or(not(or(X0,X1)),or(X1,X0))),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).
cnf(c_54,plain,
axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_6) ).
cnf(c_55,plain,
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_1) ).
cnf(c_56,plain,
( ~ axiom(or(not(X0),X1))
| ~ theorem(X0)
| theorem(X1) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/LCL003-0.ax',rule_3) ).
cnf(c_217,plain,
theorem(or(not(or(X0,X0)),X0)),
inference(superposition,[status(thm)],[c_50,c_55]) ).
cnf(c_219,plain,
theorem(or(not(X0),or(X1,X0))),
inference(superposition,[status(thm)],[c_51,c_55]) ).
cnf(c_221,plain,
theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(superposition,[status(thm)],[c_52,c_55]) ).
cnf(c_223,plain,
theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(superposition,[status(thm)],[c_53,c_55]) ).
cnf(c_228,plain,
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(superposition,[status(thm)],[c_50,c_56]) ).
cnf(c_229,plain,
( ~ theorem(X0)
| theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_51,c_56]) ).
cnf(c_230,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_52,c_56]) ).
cnf(c_231,plain,
( ~ theorem(or(X0,or(X1,X2)))
| theorem(or(X1,or(X0,X2))) ),
inference(superposition,[status(thm)],[c_53,c_56]) ).
cnf(c_234,plain,
theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(superposition,[status(thm)],[c_54,c_55]) ).
cnf(c_235,plain,
( ~ theorem(or(not(X0),X1))
| theorem(or(not(or(X2,X0)),or(X2,X1))) ),
inference(superposition,[status(thm)],[c_54,c_56]) ).
cnf(c_239,plain,
( ~ axiom(or(not(X0),or(X1,X1)))
| theorem(or(not(X0),X1)) ),
inference(superposition,[status(thm)],[c_217,c_57]) ).
cnf(c_240,plain,
( ~ axiom(or(not(X0),X1))
| theorem(or(not(X0),or(X2,X1))) ),
inference(superposition,[status(thm)],[c_219,c_57]) ).
cnf(c_241,plain,
( ~ axiom(or(not(X0),or(X1,X2)))
| theorem(or(not(X0),or(X2,X1))) ),
inference(superposition,[status(thm)],[c_221,c_57]) ).
cnf(c_245,plain,
~ theorem(or(not(or(or(p,not(r)),s)),or(or(p,q),s))),
inference(superposition,[status(thm)],[c_229,c_49]) ).
cnf(c_246,plain,
( ~ axiom(or(not(X0),X1))
| ~ theorem(X2)
| theorem(or(not(X0),X2)) ),
inference(superposition,[status(thm)],[c_229,c_57]) ).
cnf(c_249,plain,
~ theorem(or(or(p,q),s)),
inference(superposition,[status(thm)],[c_229,c_245]) ).
cnf(c_251,plain,
~ theorem(s),
inference(superposition,[status(thm)],[c_229,c_249]) ).
cnf(c_257,plain,
theorem(or(X0,not(or(X0,X0)))),
inference(superposition,[status(thm)],[c_217,c_230]) ).
cnf(c_258,plain,
theorem(or(or(X0,X1),not(X1))),
inference(superposition,[status(thm)],[c_219,c_230]) ).
cnf(c_259,plain,
( ~ theorem(X0)
| theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_229,c_230]) ).
cnf(c_260,plain,
theorem(or(or(X0,X1),not(or(X1,X0)))),
inference(superposition,[status(thm)],[c_221,c_230]) ).
cnf(c_263,plain,
( ~ axiom(or(not(X0),X1))
| theorem(or(not(X0),not(or(not(X1),not(X1))))) ),
inference(superposition,[status(thm)],[c_257,c_57]) ).
cnf(c_360,plain,
~ theorem(not(or(or(p,q),r))),
inference(superposition,[status(thm)],[c_259,c_49]) ).
cnf(c_361,plain,
( ~ axiom(or(not(X0),X1))
| ~ theorem(not(X1))
| theorem(or(not(X0),X2)) ),
inference(superposition,[status(thm)],[c_259,c_57]) ).
cnf(c_364,plain,
~ theorem(not(or(or(p,not(r)),s))),
inference(superposition,[status(thm)],[c_259,c_245]) ).
cnf(c_365,plain,
~ theorem(or(p,q)),
inference(superposition,[status(thm)],[c_259,c_249]) ).
cnf(c_413,plain,
( ~ axiom(or(not(X0),or(X1,or(X2,X3))))
| theorem(or(not(X0),or(X2,or(X1,X3)))) ),
inference(superposition,[status(thm)],[c_223,c_57]) ).
cnf(c_414,plain,
theorem(or(or(X0,or(X1,X2)),not(or(X1,or(X0,X2))))),
inference(superposition,[status(thm)],[c_223,c_230]) ).
cnf(c_722,plain,
theorem(or(X0,or(not(X1),X1))),
inference(superposition,[status(thm)],[c_219,c_231]) ).
cnf(c_1014,plain,
theorem(or(not(X0),X0)),
inference(superposition,[status(thm)],[c_51,c_239]) ).
cnf(c_1387,plain,
theorem(or(X0,not(X0))),
inference(superposition,[status(thm)],[c_1014,c_230]) ).
cnf(c_6774,plain,
theorem(or(or(not(X0),X0),X1)),
inference(superposition,[status(thm)],[c_722,c_230]) ).
cnf(c_30707,plain,
( ~ theorem(X0)
| theorem(or(not(X1),X0)) ),
inference(superposition,[status(thm)],[c_51,c_246]) ).
cnf(c_36760,plain,
theorem(or(not(X0),or(X0,X1))),
inference(superposition,[status(thm)],[c_51,c_241]) ).
cnf(c_57268,plain,
theorem(or(or(X0,X1),not(X0))),
inference(superposition,[status(thm)],[c_36760,c_230]) ).
cnf(c_57269,plain,
theorem(or(X0,or(not(X0),X1))),
inference(superposition,[status(thm)],[c_36760,c_231]) ).
cnf(c_66580,plain,
theorem(or(or(not(X0),X1),X0)),
inference(superposition,[status(thm)],[c_57269,c_230]) ).
cnf(c_86388,plain,
( ~ theorem(not(X0))
| theorem(or(not(or(X0,X0)),X1)) ),
inference(superposition,[status(thm)],[c_50,c_361]) ).
cnf(c_86389,plain,
( ~ theorem(not(or(X0,X1)))
| theorem(or(not(X1),X2)) ),
inference(superposition,[status(thm)],[c_51,c_361]) ).
cnf(c_86390,plain,
( ~ theorem(not(or(X0,X1)))
| theorem(or(not(or(X1,X0)),X2)) ),
inference(superposition,[status(thm)],[c_52,c_361]) ).
cnf(c_94331,plain,
( ~ theorem(not(X0))
| theorem(not(or(X0,X0))) ),
inference(superposition,[status(thm)],[c_86388,c_228]) ).
cnf(c_102326,plain,
( ~ theorem(not(X0))
| theorem(or(not(X0),X1)) ),
inference(superposition,[status(thm)],[c_94331,c_86389]) ).
cnf(c_115362,plain,
theorem(or(not(or(X0,X1)),or(X0,or(X2,X1)))),
inference(superposition,[status(thm)],[c_51,c_413]) ).
cnf(c_115363,plain,
theorem(or(not(or(or(X0,X1),X2)),or(X0,or(X2,X1)))),
inference(superposition,[status(thm)],[c_52,c_413]) ).
cnf(c_115365,plain,
theorem(or(not(or(not(X0),X1)),or(X2,or(not(or(X2,X0)),X1)))),
inference(superposition,[status(thm)],[c_54,c_413]) ).
cnf(c_134295,plain,
( ~ theorem(not(X0))
| theorem(or(X1,not(X0))) ),
inference(superposition,[status(thm)],[c_102326,c_230]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL228-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n005.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 Aug 24 23:57:38 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 172.10/23.36 % SZS status Started for theBenchmark.p
% 172.10/23.36 % SZS status Satisfiable for theBenchmark.p
% 172.10/23.36
% 172.10/23.36 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 172.10/23.36
% 172.10/23.36 ------ iProver source info
% 172.10/23.36
% 172.10/23.36 git: date: 2023-05-31 18:12:56 +0000
% 172.10/23.36 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 172.10/23.36 git: non_committed_changes: false
% 172.10/23.36 git: last_make_outside_of_git: false
% 172.10/23.36
% 172.10/23.36 ------ Parsing...successful
% 172.10/23.36
% 172.10/23.36
% 172.10/23.36
% 172.10/23.36 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 172.10/23.36
% 172.10/23.36 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 172.10/23.36 ------ Proving...
% 172.10/23.36 ------ Problem Properties
% 172.10/23.36
% 172.10/23.36
% 172.10/23.36 clauses 9
% 172.10/23.36 conjectures 1
% 172.10/23.36 EPR 1
% 172.10/23.36 Horn 9
% 172.10/23.36 unary 6
% 172.10/23.36 binary 1
% 172.10/23.36 lits 14
% 172.10/23.36 lits eq 0
% 172.10/23.36 fd_pure 0
% 172.10/23.36 fd_pseudo 0
% 172.10/23.36 fd_cond 0
% 172.10/23.36 fd_pseudo_cond 0
% 172.10/23.36 AC symbols 0
% 172.10/23.36
% 172.10/23.36 ------ Input Options Time Limit: Unbounded
% 172.10/23.36
% 172.10/23.36
% 172.10/23.36 ------
% 172.10/23.36 Current options:
% 172.10/23.36 ------
% 172.10/23.36
% 172.10/23.36
% 172.10/23.36
% 172.10/23.36
% 172.10/23.36 ------ Proving...
% 172.10/23.36
% 172.10/23.36
% 172.10/23.36 % SZS status Satisfiable for theBenchmark.p
% 172.10/23.36
% 172.10/23.36 % SZS output start Saturation for theBenchmark.p
% See solution above
% 172.10/23.36
% 172.10/23.37
%------------------------------------------------------------------------------