%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL076-3 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 02:05:34 PM UTC 2026
% Result : Unsatisfiable 3.75s 1.20s
% Output : CNFRefutation 3.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 25 ( 15 unt; 0 def)
% Number of atoms : 39 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 30 ( 16 ~; 14 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% 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 : 48 ( 0 sgn 48 !; 0 ?; 36 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f2,axiom,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_18) ).
fof(f3,axiom,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(implies(X0,X1),implies(X0,X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_35) ).
fof(f4,axiom,
! [X0,X1] : is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_49) ).
fof(f5,axiom,
! [X2,X0,X1] :
( is_a_theorem(implies(X0,X2))
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity) ).
fof(f6,negated_conjecture,
~ is_a_theorem(implies(a,not(not(a)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_40) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(X0,implies(X1,X0))),
inference(cnf_transformation,[],[f2]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(implies(X0,X1),implies(X0,X2)))),
inference(cnf_transformation,[],[f3]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))),
inference(cnf_transformation,[],[f4]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(X2,X0))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(cnf_transformation,[],[f5]) ).
tcf(c_60,negated_conjecture,
~ is_a_theorem(implies(a,not(not(a)))),
inference(cnf_transformation,[],[f6]) ).
tcf(c_225,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(implies(not(X0),not(X1))) ),
inference(resolution,[status(thm)],[c_58,c_55]) ).
tcf(c_272,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(implies(X0,X1),implies(X0,X2)))
| ~ is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[status(thm)],[c_57,c_55]) ).
tcf(c_285,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X0,X1),X2)) ),
inference(resolution,[status(thm)],[c_59,c_56]) ).
tcf(c_388,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(not(X0),implies(X0,X1))),
inference(resolution,[status(thm)],[c_285,c_58]) ).
tcf(c_449,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(not(X0),X2))
| ~ is_a_theorem(implies(implies(X0,X1),X2)) ),
inference(resolution,[status(thm)],[c_388,c_59]) ).
tcf(c_572,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(X1,implies(X0,X2)))
| ~ is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[status(thm)],[c_272,c_285]) ).
tcf(c_1456,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(not(not(X0)),implies(X1,X0))),
inference(resolution,[status(thm)],[c_449,c_58]) ).
tcf(c_1899,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(X0,implies(not(not(X1)),X1))),
inference(resolution,[status(thm)],[c_572,c_1456]) ).
tcf(c_3992,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(not(not(X1)),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_1899,c_55]) ).
tcf(c_10008,plain,
! [X0: $i] : is_a_theorem(implies(not(not(X0)),X0)),
inference(resolution,[status(thm)],[c_3992,c_56]) ).
tcf(c_10066,plain,
! [X0: $i] : is_a_theorem(implies(X0,not(not(X0)))),
inference(resolution,[status(thm)],[c_10008,c_225]) ).
tcf(c_10067,plain,
is_a_theorem(implies(a,not(not(a)))),
inference(instantiation,[status(thm)],[c_10066]) ).
tcf(c_10068,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_10067,c_60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL076-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.37 % Computer : n011.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Wed Sep 23 21:50:27 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.41
% 0.14/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.41
% 0.14/0.42 % Detected problem language: tptp
% 0.14/0.43 % Proving...
% 3.75/1.20 % SZS status Started for theBenchmark.p
% 3.75/1.20 % SZS status Unsatisfiable for theBenchmark.p
% 3.75/1.20
% 3.75/1.20 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.75/1.20
% 3.75/1.20 % ------ iProver source info
% 3.75/1.20
% 3.75/1.20 % git: date: 2026-07-19 20:42:38 +0200
% 3.75/1.20 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.75/1.20 % git: non_committed_changes: false
% 3.75/1.20
% 3.75/1.20 % ------ Parsing...% successful
% 3.75/1.20
% 3.75/1.20
% 3.75/1.20 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.75/1.20
% 3.75/1.20 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.75/1.20
% 3.75/1.20 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.75/1.20 % ------ Proving...
% 3.75/1.20 % ------ Problem Properties
% 3.75/1.20
% 3.75/1.20 %
% 3.75/1.20 % clauses 6
% 3.75/1.20 % conjectures 1
% 3.75/1.20 % EPR 0
% 3.75/1.20 % Horn 6
% 3.75/1.20 % unary 4
% 3.75/1.20 % binary 0
% 3.75/1.20 % lits 10
% 3.75/1.20 % lits eq 0
% 3.75/1.20 % fd_pure 0
% 3.75/1.20 % fd_pseudo 0
% 3.75/1.20 % fd_cond 0
% 3.75/1.20 % fd_pseudo_cond 0
% 3.75/1.20 % AC symbols 0
% 3.75/1.20
% 3.75/1.20 % ------ Input Options Time Limit: Unbounded
% 3.75/1.20
% 3.75/1.20
% 3.75/1.20 % ------
% 3.75/1.20 % Current options:
% 3.75/1.20 % ------
% 3.75/1.20
% 3.75/1.20
% 3.75/1.20 %
% 3.75/1.20
% 3.75/1.20 % ------ Proving...
% 3.75/1.20 %
% 3.75/1.20
% 3.75/1.20 % SZS status Unsatisfiable for theBenchmark.p
% 3.75/1.20
% 3.75/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.75/1.20
% 3.75/1.20
%------------------------------------------------------------------------------