TSTP Solution File: LCL203-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL203-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n009.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:14 EDT 2024
% Result : Unsatisfiable 3.99s 1.23s
% Output : CNFRefutation 3.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 12 unt; 0 nHn; 13 RR)
% Number of literals : 39 ( 0 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 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 : 40 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(or(not(not(or(p,q))),or(not(p),not(q)))),
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_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_259,plain,
theorem(or(not(X0),or(X1,X0))),
inference(superposition,[status(thm)],[c_51,c_55]) ).
cnf(c_277,plain,
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(superposition,[status(thm)],[c_50,c_56]) ).
cnf(c_278,plain,
( ~ theorem(X0)
| theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_51,c_56]) ).
cnf(c_279,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_52,c_56]) ).
cnf(c_312,plain,
( ~ theorem(or(X0,or(X1,X2)))
| theorem(or(X1,or(X0,X2))) ),
inference(superposition,[status(thm)],[c_53,c_56]) ).
cnf(c_417,plain,
theorem(or(X0,or(not(X1),X1))),
inference(superposition,[status(thm)],[c_259,c_312]) ).
cnf(c_520,plain,
theorem(or(not(X0),X0)),
inference(superposition,[status(thm)],[c_417,c_277]) ).
cnf(c_549,plain,
( ~ axiom(or(not(X0),X1))
| ~ theorem(X2)
| theorem(or(not(X0),X2)) ),
inference(superposition,[status(thm)],[c_278,c_57]) ).
cnf(c_649,plain,
theorem(or(X0,not(X0))),
inference(superposition,[status(thm)],[c_520,c_279]) ).
cnf(c_931,plain,
( ~ axiom(or(not(X0),X1))
| theorem(or(not(X0),not(not(X1)))) ),
inference(superposition,[status(thm)],[c_649,c_57]) ).
cnf(c_1374,plain,
( ~ axiom(or(not(X0),X1))
| theorem(or(not(not(X1)),not(X0))) ),
inference(superposition,[status(thm)],[c_931,c_279]) ).
cnf(c_1655,plain,
( ~ theorem(X0)
| theorem(or(not(X1),X0)) ),
inference(superposition,[status(thm)],[c_51,c_549]) ).
cnf(c_1688,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X0,or(not(X2),X1))) ),
inference(superposition,[status(thm)],[c_1655,c_312]) ).
cnf(c_2222,plain,
~ theorem(or(not(not(or(p,q))),not(q))),
inference(superposition,[status(thm)],[c_1688,c_49]) ).
cnf(c_2817,plain,
~ axiom(or(not(q),or(p,q))),
inference(superposition,[status(thm)],[c_1374,c_2222]) ).
cnf(c_2898,plain,
$false,
inference(superposition,[status(thm)],[c_51,c_2817]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : LCL203-1 : TPTP v8.1.2. Released v1.1.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n009.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Thu May 2 19:12:11 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.99/1.23 % SZS status Started for theBenchmark.p
% 3.99/1.23 % SZS status Unsatisfiable for theBenchmark.p
% 3.99/1.23
% 3.99/1.23 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.99/1.23
% 3.99/1.23 ------ iProver source info
% 3.99/1.23
% 3.99/1.23 git: date: 2024-05-02 19:28:25 +0000
% 3.99/1.23 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.99/1.23 git: non_committed_changes: false
% 3.99/1.23
% 3.99/1.23 ------ Parsing...successful
% 3.99/1.23
% 3.99/1.23
% 3.99/1.23
% 3.99/1.23 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 3.99/1.23
% 3.99/1.23 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.99/1.23 ------ Proving...
% 3.99/1.23 ------ Problem Properties
% 3.99/1.23
% 3.99/1.23
% 3.99/1.23 clauses 9
% 3.99/1.23 conjectures 1
% 3.99/1.23 EPR 1
% 3.99/1.23 Horn 9
% 3.99/1.23 unary 6
% 3.99/1.23 binary 1
% 3.99/1.23 lits 14
% 3.99/1.23 lits eq 0
% 3.99/1.23 fd_pure 0
% 3.99/1.23 fd_pseudo 0
% 3.99/1.23 fd_cond 0
% 3.99/1.23 fd_pseudo_cond 0
% 3.99/1.23 AC symbols 0
% 3.99/1.23
% 3.99/1.23 ------ Input Options Time Limit: Unbounded
% 3.99/1.23
% 3.99/1.23
% 3.99/1.23 ------
% 3.99/1.23 Current options:
% 3.99/1.23 ------
% 3.99/1.23
% 3.99/1.23
% 3.99/1.23
% 3.99/1.23
% 3.99/1.23 ------ Proving...
% 3.99/1.23
% 3.99/1.23
% 3.99/1.23 % SZS status Unsatisfiable for theBenchmark.p
% 3.99/1.23
% 3.99/1.23 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.99/1.23
% 3.99/1.23
%------------------------------------------------------------------------------