TSTP Solution File: LCL237-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL237-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n028.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:26 EDT 2023
% Result : Unsatisfiable 9.42s 2.14s
% Output : CNFRefutation 9.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 26 ( 10 unt; 0 nHn; 13 RR)
% Number of literals : 45 ( 0 equ; 20 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 : 58 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(or(not(q),or(not(p),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_307,plain,
( ~ axiom(or(not(X0),or(X1,X2)))
| ~ theorem(or(not(X2),X3))
| theorem(or(not(X0),or(X1,X3))) ),
inference(superposition,[status(thm)],[c_233,c_57]) ).
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_501,plain,
( ~ theorem(or(not(X0),X1))
| theorem(or(not(or(X0,X2)),or(X2,X1))) ),
inference(superposition,[status(thm)],[c_52,c_307]) ).
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_977,plain,
( ~ theorem(or(not(X0),X1))
| theorem(or(or(X2,X1),not(or(X0,X2)))) ),
inference(superposition,[status(thm)],[c_501,c_229]) ).
cnf(c_3538,plain,
( ~ theorem(or(not(X0),or(X1,not(or(X0,X2)))))
| theorem(or(X2,or(X1,not(or(X0,X2))))) ),
inference(superposition,[status(thm)],[c_977,c_739]) ).
cnf(c_27262,plain,
theorem(or(X0,or(X1,not(or(X1,X0))))),
inference(superposition,[status(thm)],[c_360,c_3538]) ).
cnf(c_27355,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_49,c_27262]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL237-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.33 % Computer : n028.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Fri Aug 25 07:00:51 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 9.42/2.14 % SZS status Started for theBenchmark.p
% 9.42/2.14 % SZS status Unsatisfiable for theBenchmark.p
% 9.42/2.14
% 9.42/2.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 9.42/2.14
% 9.42/2.14 ------ iProver source info
% 9.42/2.14
% 9.42/2.14 git: date: 2023-05-31 18:12:56 +0000
% 9.42/2.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 9.42/2.14 git: non_committed_changes: false
% 9.42/2.14 git: last_make_outside_of_git: false
% 9.42/2.14
% 9.42/2.14 ------ Parsing...successful
% 9.42/2.14
% 9.42/2.14
% 9.42/2.14
% 9.42/2.14 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 9.42/2.14
% 9.42/2.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 9.42/2.14 ------ Proving...
% 9.42/2.14 ------ Problem Properties
% 9.42/2.14
% 9.42/2.14
% 9.42/2.14 clauses 9
% 9.42/2.14 conjectures 1
% 9.42/2.14 EPR 1
% 9.42/2.14 Horn 9
% 9.42/2.14 unary 6
% 9.42/2.14 binary 1
% 9.42/2.14 lits 14
% 9.42/2.14 lits eq 0
% 9.42/2.14 fd_pure 0
% 9.42/2.14 fd_pseudo 0
% 9.42/2.14 fd_cond 0
% 9.42/2.14 fd_pseudo_cond 0
% 9.42/2.14 AC symbols 0
% 9.42/2.14
% 9.42/2.14 ------ Input Options Time Limit: Unbounded
% 9.42/2.14
% 9.42/2.14
% 9.42/2.14 ------
% 9.42/2.14 Current options:
% 9.42/2.14 ------
% 9.42/2.14
% 9.42/2.14
% 9.42/2.14
% 9.42/2.14
% 9.42/2.14 ------ Proving...
% 9.42/2.14
% 9.42/2.14
% 9.42/2.14 % SZS status Unsatisfiable for theBenchmark.p
% 9.42/2.14
% 9.42/2.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 9.42/2.14
% 9.42/2.14
%------------------------------------------------------------------------------