TSTP Solution File: LCL201-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL201-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n021.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:13 EDT 2024
% Result : Unsatisfiable 27.96s 4.64s
% Output : CNFRefutation 27.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 17 ( 11 unt; 0 nHn; 8 RR)
% Number of literals : 25 ( 0 equ; 9 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 : 37 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(or(not(not(or(p,q))),or(not(p),q))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
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_182,plain,
theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[status(thm)],[c_52,c_55]) ).
cnf(c_284,plain,
( ~ theorem(or(X0,or(X1,X2)))
| theorem(or(X1,or(X0,X2))) ),
inference(resolution,[status(thm)],[c_53,c_56]) ).
cnf(c_339,plain,
( ~ theorem(or(not(or(X0,X1)),X2))
| theorem(or(not(X1),X2)) ),
inference(resolution,[status(thm)],[c_57,c_51]) ).
cnf(c_340,plain,
( ~ theorem(or(not(or(X0,X1)),X2))
| theorem(or(not(or(X1,X0)),X2)) ),
inference(resolution,[status(thm)],[c_57,c_52]) ).
cnf(c_1166,plain,
theorem(or(not(X0),or(X0,X1))),
inference(resolution,[status(thm)],[c_339,c_182]) ).
cnf(c_1750,plain,
theorem(or(X0,or(not(X0),X1))),
inference(resolution,[status(thm)],[c_1166,c_284]) ).
cnf(c_1823,plain,
theorem(or(not(or(X0,X1)),or(not(not(or(X1,X0))),X2))),
inference(resolution,[status(thm)],[c_1750,c_340]) ).
cnf(c_34976,plain,
theorem(or(not(X0),or(not(not(or(X0,X1))),X2))),
inference(resolution,[status(thm)],[c_1823,c_339]) ).
cnf(c_35326,plain,
theorem(or(not(not(or(X0,X1))),or(not(X0),X2))),
inference(resolution,[status(thm)],[c_34976,c_284]) ).
cnf(c_37360,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_49,c_35326]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : LCL201-1 : TPTP v8.1.2. Released v1.1.0.
% 0.03/0.11 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n021.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 : Thu May 2 19:07:58 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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
% 27.96/4.64 % SZS status Started for theBenchmark.p
% 27.96/4.64 % SZS status Unsatisfiable for theBenchmark.p
% 27.96/4.64
% 27.96/4.64 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 27.96/4.64
% 27.96/4.64 ------ iProver source info
% 27.96/4.64
% 27.96/4.64 git: date: 2024-05-02 19:28:25 +0000
% 27.96/4.64 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 27.96/4.64 git: non_committed_changes: false
% 27.96/4.64
% 27.96/4.64 ------ Parsing...successful
% 27.96/4.64
% 27.96/4.64
% 27.96/4.64
% 27.96/4.64 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 27.96/4.64
% 27.96/4.64 ------ Preprocessing...
% 27.96/4.64 ------ Proving...
% 27.96/4.64 ------ Problem Properties
% 27.96/4.64
% 27.96/4.64
% 27.96/4.64 clauses 9
% 27.96/4.64 conjectures 1
% 27.96/4.64 EPR 1
% 27.96/4.64 Horn 9
% 27.96/4.64 unary 6
% 27.96/4.64 binary 1
% 27.96/4.64 lits 14
% 27.96/4.64 lits eq 0
% 27.96/4.64 fd_pure 0
% 27.96/4.64 fd_pseudo 0
% 27.96/4.64 fd_cond 0
% 27.96/4.64 fd_pseudo_cond 0
% 27.96/4.64 AC symbols 0
% 27.96/4.64
% 27.96/4.64 ------ Input Options Time Limit: Unbounded
% 27.96/4.64
% 27.96/4.64
% 27.96/4.64 ------
% 27.96/4.64 Current options:
% 27.96/4.64 ------
% 27.96/4.64
% 27.96/4.64
% 27.96/4.64
% 27.96/4.64
% 27.96/4.64 ------ Proving...
% 27.96/4.64
% 27.96/4.64
% 27.96/4.64 % SZS status Unsatisfiable for theBenchmark.p
% 27.96/4.64
% 27.96/4.64 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 27.96/4.64
% 27.96/4.64
%------------------------------------------------------------------------------