TSTP Solution File: LCL043-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL043-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n015.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:42:11 EDT 2023
% Result : Unsatisfiable 2.39s 1.11s
% Output : CNFRefutation 2.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 12 ( 7 unt; 0 nHn; 8 RR)
% Number of literals : 19 ( 0 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 15 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(c_50,plain,
is_a_theorem(implies(X0,implies(not(X0),X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_3) ).
cnf(c_51,plain,
is_a_theorem(implies(X0,implies(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_18) ).
cnf(c_54,plain,
is_a_theorem(implies(implies(X0,X1),implies(implies(not(X0),X1),X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_54) ).
cnf(c_55,negated_conjecture,
~ is_a_theorem(implies(not(not(a)),a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_39) ).
cnf(c_247,plain,
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(implies(not(X0),X1),X1)) ),
inference(superposition,[status(thm)],[c_54,c_49]) ).
cnf(c_377,plain,
( ~ is_a_theorem(implies(not(X0),X1))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1) ),
inference(superposition,[status(thm)],[c_247,c_49]) ).
cnf(c_1239,plain,
( ~ is_a_theorem(implies(X0,implies(not(not(X0)),X1)))
| is_a_theorem(implies(not(not(X0)),X1)) ),
inference(superposition,[status(thm)],[c_50,c_377]) ).
cnf(c_1286,plain,
( ~ is_a_theorem(implies(a,implies(not(not(a)),a)))
| is_a_theorem(implies(not(not(a)),a)) ),
inference(instantiation,[status(thm)],[c_1239]) ).
cnf(c_3998,plain,
is_a_theorem(implies(X0,implies(not(not(X0)),X0))),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_3999,plain,
is_a_theorem(implies(a,implies(not(not(a)),a))),
inference(instantiation,[status(thm)],[c_3998]) ).
cnf(c_4000,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_3999,c_1286,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : LCL043-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.10 % Command : run_iprover %s %d THM
% 0.09/0.31 % Computer : n015.cluster.edu
% 0.09/0.31 % Model : x86_64 x86_64
% 0.09/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.31 % Memory : 8042.1875MB
% 0.09/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.31 % CPULimit : 300
% 0.09/0.31 % WCLimit : 300
% 0.09/0.31 % DateTime : Fri Aug 25 07:36:52 EDT 2023
% 0.09/0.31 % CPUTime :
% 0.15/0.43 Running first-order theorem proving
% 0.15/0.43 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.39/1.11 % SZS status Started for theBenchmark.p
% 2.39/1.11 % SZS status Unsatisfiable for theBenchmark.p
% 2.39/1.11
% 2.39/1.11 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.39/1.11
% 2.39/1.11 ------ iProver source info
% 2.39/1.11
% 2.39/1.11 git: date: 2023-05-31 18:12:56 +0000
% 2.39/1.11 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.39/1.11 git: non_committed_changes: false
% 2.39/1.11 git: last_make_outside_of_git: false
% 2.39/1.11
% 2.39/1.11 ------ Parsing...successful
% 2.39/1.11
% 2.39/1.11
% 2.39/1.11
% 2.39/1.11 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 2.39/1.11
% 2.39/1.11 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.39/1.11 ------ Proving...
% 2.39/1.11 ------ Problem Properties
% 2.39/1.11
% 2.39/1.11
% 2.39/1.11 clauses 7
% 2.39/1.11 conjectures 1
% 2.39/1.11 EPR 0
% 2.39/1.11 Horn 7
% 2.39/1.11 unary 6
% 2.39/1.11 binary 0
% 2.39/1.11 lits 9
% 2.39/1.11 lits eq 0
% 2.39/1.11 fd_pure 0
% 2.39/1.11 fd_pseudo 0
% 2.39/1.11 fd_cond 0
% 2.39/1.11 fd_pseudo_cond 0
% 2.39/1.11 AC symbols 0
% 2.39/1.11
% 2.39/1.11 ------ Schedule dynamic 5 is on
% 2.39/1.11
% 2.39/1.11 ------ no equalities: superposition off
% 2.39/1.11
% 2.39/1.11 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.39/1.11
% 2.39/1.11
% 2.39/1.11 ------
% 2.39/1.11 Current options:
% 2.39/1.11 ------
% 2.39/1.11
% 2.39/1.11
% 2.39/1.11
% 2.39/1.11
% 2.39/1.11 ------ Proving...
% 2.39/1.11
% 2.39/1.11
% 2.39/1.11 % SZS status Unsatisfiable for theBenchmark.p
% 2.39/1.11
% 2.39/1.11 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.39/1.11
% 2.39/1.11
%------------------------------------------------------------------------------