%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL079-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n016.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:35 PM UTC 2026
% Result : Unsatisfiable 2.25s 1.18s
% Output : CNFRefutation 2.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 22 ( 15 unt; 1 def)
% Number of atoms : 38 ( 1 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 25 ( 15 ~; 10 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn 21 !; 0 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f2,axiom,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',cn_35) ).
fof(f5,axiom,
is_a_theorem(implies(a,b)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_implies_b) ).
fof(f6,axiom,
is_a_theorem(implies(b,c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_implies_c) ).
fof(f7,negated_conjecture,
~ is_a_theorem(implies(a,c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_transitivity) ).
tcf(c_56,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_57,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(X0,implies(X1,X0))),
inference(cnf_transformation,[],[f2]) ).
tcf(c_58,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_60,plain,
is_a_theorem(implies(a,b)),
inference(cnf_transformation,[],[f5]) ).
tcf(c_61,plain,
is_a_theorem(implies(b,c)),
inference(cnf_transformation,[],[f6]) ).
tcf(c_62,negated_conjecture,
~ is_a_theorem(implies(a,c)),
inference(cnf_transformation,[],[f7]) ).
tcf(c_84,definition,
iPr_def_10 = implies(a,c),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_85,negated_conjecture,
~ is_a_theorem(iPr_def_10),
inference(demodulation,[status(thm)],[c_62,c_84]) ).
tcf(c_180,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_57,c_56]) ).
tcf(c_203,plain,
! [X0: $i] : is_a_theorem(implies(implies(a,implies(X0,c)),implies(implies(a,X0),iPr_def_10))),
inference(superposition,[status(thm)],[c_84,c_58]) ).
tcf(c_279,plain,
! [X0: $i] :
( is_a_theorem(implies(implies(a,X0),iPr_def_10))
| ~ is_a_theorem(implies(a,implies(X0,c))) ),
inference(superposition,[status(thm)],[c_203,c_56]) ).
tcf(c_466,plain,
! [X0: $i] :
( is_a_theorem(implies(implies(a,X0),iPr_def_10))
| ~ is_a_theorem(implies(X0,c)) ),
inference(superposition,[status(thm)],[c_180,c_279]) ).
tcf(c_489,plain,
! [X0: $i] :
( is_a_theorem(iPr_def_10)
| ~ is_a_theorem(implies(a,X0))
| ~ is_a_theorem(implies(X0,c)) ),
inference(superposition,[status(thm)],[c_466,c_56]) ).
tcf(c_490,plain,
! [X0: $i] :
( ~ is_a_theorem(implies(a,X0))
| ~ is_a_theorem(implies(X0,c)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_489,c_85]) ).
tcf(c_504,plain,
~ is_a_theorem(implies(a,b)),
inference(superposition,[status(thm)],[c_61,c_490]) ).
tcf(c_507,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_504,c_60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL079-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.36 % Computer : n016.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Wed Sep 23 21:55:57 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 2.25/1.18 % SZS status Started for theBenchmark.p
% 2.25/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 2.25/1.18
% 2.25/1.18 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.25/1.18
% 2.25/1.18 % ------ iProver source info
% 2.25/1.18
% 2.25/1.18 % git: date: 2026-07-19 20:42:38 +0200
% 2.25/1.18 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.25/1.18 % git: non_committed_changes: false
% 2.25/1.18
% 2.25/1.18 % ------ Parsing...% successful
% 2.25/1.18
% 2.25/1.18
% 2.25/1.18 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.25/1.18
% 2.25/1.18 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.25/1.18
% 2.25/1.18 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.25/1.18
% 2.25/1.18 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.25/1.18 % ------ Proving...
% 2.25/1.18 % ------ Problem Properties
% 2.25/1.18
% 2.25/1.18 %
% 2.25/1.18 % clauses 8
% 2.25/1.18 % conjectures 1
% 2.25/1.18 % EPR 1
% 2.25/1.18 % Horn 8
% 2.25/1.18 % unary 7
% 2.25/1.18 % binary 0
% 2.25/1.18 % lits 10
% 2.25/1.18 % lits eq 1
% 2.25/1.18 % fd_pure 0
% 2.25/1.18 % fd_pseudo 0
% 2.25/1.18 % fd_cond 0
% 2.25/1.18 % fd_pseudo_cond 0
% 2.25/1.18 % AC symbols 0
% 2.25/1.18
% 2.25/1.18 % ------ Schedule dynamic 5 is on
% 2.25/1.18
% 2.25/1.18 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.25/1.18
% 2.25/1.18
% 2.25/1.18 % ------
% 2.25/1.18 % Current options:
% 2.25/1.18 % ------
% 2.25/1.18
% 2.25/1.18
% 2.25/1.18 %
% 2.25/1.18
% 2.25/1.18 % ------ Proving...
% 2.25/1.18 %
% 2.25/1.18
% 2.25/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 2.25/1.18
% 2.25/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.25/1.18
% 2.25/1.18
%------------------------------------------------------------------------------