TSTP Solution File: LCL234-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL234-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n006.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:23 EDT 2023
% Result : Unsatisfiable 4.07s 1.17s
% Output : CNFRefutation 4.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 24 ( 10 unt; 0 nHn; 12 RR)
% Number of literals : 40 ( 0 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 51 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(or(not(p),or(not(q),not(or(not(p),not(q)))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_50,plain,
axiom(or(not(or(X0,X0)),X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_2) ).
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_54,plain,
axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_6) ).
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_220,plain,
theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(superposition,[status(thm)],[c_52,c_55]) ).
cnf(c_227,plain,
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(superposition,[status(thm)],[c_50,c_56]) ).
cnf(c_228,plain,
( ~ theorem(X0)
| theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_51,c_56]) ).
cnf(c_229,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_233,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_247,plain,
( ~ axiom(or(not(X0),or(X1,X2)))
| theorem(or(not(X0),or(X2,X1))) ),
inference(superposition,[status(thm)],[c_220,c_57]) ).
cnf(c_287,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X0,or(X2,X1))) ),
inference(superposition,[status(thm)],[c_228,c_231]) ).
cnf(c_308,plain,
( ~ theorem(or(not(X0),X1))
| theorem(or(or(X2,X1),not(or(X2,X0)))) ),
inference(superposition,[status(thm)],[c_233,c_229]) ).
cnf(c_360,plain,
theorem(or(not(X0),or(X0,X1))),
inference(superposition,[status(thm)],[c_51,c_247]) ).
cnf(c_433,plain,
( ~ theorem(or(or(X0,X1),X1))
| theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_287,c_227]) ).
cnf(c_739,plain,
( ~ theorem(or(or(X0,or(X1,X2)),X2))
| theorem(or(X0,or(X1,X2))) ),
inference(superposition,[status(thm)],[c_287,c_433]) ).
cnf(c_1899,plain,
( ~ theorem(or(not(X0),or(X1,not(or(X2,X0)))))
| theorem(or(X2,or(X1,not(or(X2,X0))))) ),
inference(superposition,[status(thm)],[c_308,c_739]) ).
cnf(c_11019,plain,
theorem(or(X0,or(X1,not(or(X0,X1))))),
inference(superposition,[status(thm)],[c_360,c_1899]) ).
cnf(c_11075,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_49,c_11019]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL234-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n006.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri Aug 25 04:26:53 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.07/1.17 % SZS status Started for theBenchmark.p
% 4.07/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 4.07/1.17
% 4.07/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 4.07/1.17
% 4.07/1.17 ------ iProver source info
% 4.07/1.17
% 4.07/1.17 git: date: 2023-05-31 18:12:56 +0000
% 4.07/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 4.07/1.17 git: non_committed_changes: false
% 4.07/1.17 git: last_make_outside_of_git: false
% 4.07/1.17
% 4.07/1.17 ------ Parsing...successful
% 4.07/1.17
% 4.07/1.17
% 4.07/1.17
% 4.07/1.17 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 4.07/1.17
% 4.07/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.07/1.17 ------ Proving...
% 4.07/1.17 ------ Problem Properties
% 4.07/1.17
% 4.07/1.17
% 4.07/1.17 clauses 9
% 4.07/1.17 conjectures 1
% 4.07/1.17 EPR 1
% 4.07/1.17 Horn 9
% 4.07/1.17 unary 6
% 4.07/1.17 binary 1
% 4.07/1.17 lits 14
% 4.07/1.17 lits eq 0
% 4.07/1.17 fd_pure 0
% 4.07/1.17 fd_pseudo 0
% 4.07/1.17 fd_cond 0
% 4.07/1.17 fd_pseudo_cond 0
% 4.07/1.17 AC symbols 0
% 4.07/1.17
% 4.07/1.17 ------ Input Options Time Limit: Unbounded
% 4.07/1.17
% 4.07/1.17
% 4.07/1.17 ------
% 4.07/1.17 Current options:
% 4.07/1.17 ------
% 4.07/1.17
% 4.07/1.17
% 4.07/1.17
% 4.07/1.17
% 4.07/1.17 ------ Proving...
% 4.07/1.17
% 4.07/1.17
% 4.07/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 4.07/1.17
% 4.07/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.07/1.17
% 4.07/1.17
%------------------------------------------------------------------------------