%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL087-1 : 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 : n004.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:36 PM UTC 2026
% Result : Unsatisfiable 2.84s 1.18s
% Output : CNFRefutation 2.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 13 unt; 0 def)
% Number of atoms : 31 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 22 ( 12 ~; 10 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 6 ( 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; 2 con; 0-2 aty)
% Number of variables : 65 ( 0 sgn 65 !; 0 ?; 58 :)
% 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,
! [X2,X3,X0,X1,X4] : is_a_theorem(implies(implies(implies(X0,X1),implies(X2,X3)),implies(X4,implies(implies(X3,X0),implies(X2,X0))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ic_JLukasiewicz_4) ).
fof(f3,negated_conjecture,
~ is_a_theorem(implies(a,implies(b,a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ic_2) ).
tcf(c_52,negated_conjecture,
~ is_a_theorem(implies(a,implies(b,a))),
inference(cnf_transformation,[],[f3]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : is_a_theorem(implies(implies(implies(X0,X1),implies(X2,X3)),implies(X4,implies(implies(X3,X0),implies(X2,X0))))),
inference(cnf_transformation,[],[f2]) ).
tcf(c_54,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_111,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( is_a_theorem(implies(X4,implies(implies(X3,X0),implies(X2,X0))))
| ~ is_a_theorem(implies(implies(X0,X1),implies(X2,X3))) ),
inference(superposition,[status(thm)],[c_53,c_54]) ).
tcf(c_143,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] : is_a_theorem(implies(X0,implies(implies(implies(implies(X1,X2),implies(X3,X2)),implies(X2,X4)),implies(X5,implies(X2,X4))))),
inference(superposition,[status(thm)],[c_53,c_111]) ).
tcf(c_162,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
( is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),implies(X2,X4)),implies(X5,implies(X2,X4))))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_143,c_54]) ).
tcf(c_225,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : is_a_theorem(implies(implies(implies(implies(X0,X1),implies(X2,X1)),implies(X1,X3)),implies(X4,implies(X1,X3)))),
inference(superposition,[status(thm)],[c_53,c_162]) ).
tcf(c_233,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( is_a_theorem(implies(X4,implies(X1,X3)))
| ~ is_a_theorem(implies(implies(implies(X0,X1),implies(X2,X1)),implies(X1,X3))) ),
inference(superposition,[status(thm)],[c_225,c_54]) ).
tcf(c_322,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(implies(X0,implies(implies(X1,X2),implies(X2,implies(X1,X2))))),
inference(superposition,[status(thm)],[c_225,c_233]) ).
tcf(c_701,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(implies(X1,X2),implies(X2,implies(X1,X2))))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_322,c_54]) ).
tcf(c_1191,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(implies(X0,X1),implies(X1,implies(X0,X1)))),
inference(superposition,[status(thm)],[c_53,c_701]) ).
tcf(c_1213,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(implies(X0,implies(implies(implies(X1,X2),X1),implies(X2,X1)))),
inference(superposition,[status(thm)],[c_1191,c_111]) ).
tcf(c_1655,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X2,X1)))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_1213,c_54]) ).
tcf(c_1852,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(implies(implies(X0,X1),X0),implies(X1,X0))),
inference(superposition,[status(thm)],[c_1213,c_1655]) ).
tcf(c_2893,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(implies(X0,implies(X1,implies(X2,X1)))),
inference(superposition,[status(thm)],[c_1852,c_233]) ).
tcf(c_2904,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(X1,implies(X2,X1)))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_2893,c_54]) ).
tcf(c_2986,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(X0,implies(X1,X0))),
inference(superposition,[status(thm)],[c_1852,c_2904]) ).
tcf(c_2989,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_52,c_2986]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL087-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.36 % Computer : n004.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Wed Sep 23 21:52:35 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.40 Running first-order theorem proving
% 0.12/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.12/0.41
% 0.12/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.41
% 0.12/0.41 % Detected problem language: tptp
% 0.12/0.42 % Proving...
% 2.84/1.18 % SZS status Started for theBenchmark.p
% 2.84/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 2.84/1.18
% 2.84/1.18 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.84/1.18
% 2.84/1.18 % ------ iProver source info
% 2.84/1.18
% 2.84/1.18 % git: date: 2026-07-19 20:42:38 +0200
% 2.84/1.18 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.84/1.18 % git: non_committed_changes: false
% 2.84/1.18
% 2.84/1.18 % ------ Parsing...% successful
% 2.84/1.18
% 2.84/1.18
% 2.84/1.18 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.84/1.18
% 2.84/1.18 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.84/1.18
% 2.84/1.18 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.84/1.18 % ------ Proving...
% 2.84/1.18 % ------ Problem Properties
% 2.84/1.18
% 2.84/1.18 %
% 2.84/1.18 % clauses 3
% 2.84/1.18 % conjectures 1
% 2.84/1.18 % EPR 0
% 2.84/1.18 % Horn 3
% 2.84/1.18 % unary 2
% 2.84/1.18 % binary 0
% 2.84/1.18 % lits 5
% 2.84/1.18 % lits eq 0
% 2.84/1.18 % fd_pure 0
% 2.84/1.18 % fd_pseudo 0
% 2.84/1.18 % fd_cond 0
% 2.84/1.18 % fd_pseudo_cond 0
% 2.84/1.18 % AC symbols 0
% 2.84/1.18
% 2.84/1.18 % ------ Schedule dynamic 5 is on
% 2.84/1.18
% 2.84/1.18 % ------ no equalities: superposition off
% 2.84/1.18
% 2.84/1.18 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.84/1.18
% 2.84/1.18
% 2.84/1.18 % ------
% 2.84/1.18 % Current options:
% 2.84/1.18 % ------
% 2.84/1.18
% 2.84/1.18
% 2.84/1.18 %
% 2.84/1.18
% 2.84/1.18 % ------ Proving...
% 2.84/1.18 %
% 2.84/1.18
% 2.84/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 2.84/1.18
% 2.84/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.84/1.18
% 2.84/1.18
%------------------------------------------------------------------------------