%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL106-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 : 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:39 PM UTC 2026
% Result : Unsatisfiable 2.74s 21.33s
% Output : CNFRefutation 2.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 8 unt; 0 def)
% Number of atoms : 28 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 26 ( 14 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn 39 !; 0 ?; 31 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f2,axiom,
! [X2,X0,X1] : is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X1),X0)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',q_1) ).
fof(f3,axiom,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',q_4) ).
fof(f4,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,a),equivalent(c,b)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_q_2) ).
tcf(c_53,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,a),equivalent(c,b)))),
inference(cnf_transformation,[],[f4]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2))),
inference(cnf_transformation,[],[f3]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X1),X0)))),
inference(cnf_transformation,[],[f2]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_118,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X2))) ),
inference(superposition,[status(thm)],[c_54,c_56]) ).
tcf(c_143,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X1),X0)))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_55,c_56]) ).
tcf(c_177,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(X1,X0),X2))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_143,c_56]) ).
tcf(c_206,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X0,X2))
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_177,c_118]) ).
tcf(c_307,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(equivalent(equivalent(equivalent(X3,X0),equivalent(X3,X1)),X2))
| ~ is_a_theorem(equivalent(equivalent(X0,X1),X2)) ),
inference(superposition,[status(thm)],[c_54,c_206]) ).
tcf(c_471,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(equivalent(equivalent(X2,X1),X3))
| ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),X3))) ),
inference(superposition,[status(thm)],[c_307,c_118]) ).
tcf(c_753,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),equivalent(X2,X1)))),
inference(superposition,[status(thm)],[c_55,c_471]) ).
tcf(c_765,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_53,c_753]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL106-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.08/0.34 % Computer : n011.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/20.41 % CPULimit : 300
% 0.09/20.41 % WCLimit : 300
% 0.09/20.41 % DateTime : Wed Sep 23 21:56:49 UTC 2026
% 0.09/20.42 % CPUTime :
% 0.09/20.42 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/20.45 Running first-order theorem proving
% 0.09/20.45 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.09/20.47
% 0.09/20.47 % ======== iProver multi-core TPTP/SMT =========
% 0.09/20.47
% 0.09/20.47 % Detected problem language: tptp
% 0.09/20.48 % Proving...
% 2.74/21.33 % SZS status Started for theBenchmark.p
% 2.74/21.33 % SZS status Unsatisfiable for theBenchmark.p
% 2.74/21.33
% 2.74/21.33 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.74/21.33
% 2.74/21.33 % ------ iProver source info
% 2.74/21.33
% 2.74/21.33 % git: date: 2026-07-19 20:42:38 +0200
% 2.74/21.33 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.74/21.33 % git: non_committed_changes: false
% 2.74/21.33
% 2.74/21.33 % ------ Parsing...% successful
% 2.74/21.33
% 2.74/21.33
% 2.74/21.33 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.74/21.33
% 2.74/21.33 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.74/21.33
% 2.74/21.33 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.74/21.33 % ------ Proving...
% 2.74/21.33 % ------ Problem Properties
% 2.74/21.33
% 2.74/21.33 %
% 2.74/21.33 % clauses 4
% 2.74/21.33 % conjectures 1
% 2.74/21.33 % EPR 0
% 2.74/21.33 % Horn 4
% 2.74/21.33 % unary 3
% 2.74/21.33 % binary 0
% 2.74/21.33 % lits 6
% 2.74/21.33 % lits eq 0
% 2.74/21.33 % fd_pure 0
% 2.74/21.33 % fd_pseudo 0
% 2.74/21.33 % fd_cond 0
% 2.74/21.33 % fd_pseudo_cond 0
% 2.74/21.33 % AC symbols 0
% 2.74/21.33
% 2.74/21.33 % ------ Schedule dynamic 5 is on
% 2.74/21.33
% 2.74/21.33 % ------ no equalities: superposition off
% 2.74/21.33
% 2.74/21.33 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.74/21.33
% 2.74/21.33
% 2.74/21.33 % ------
% 2.74/21.33 % Current options:
% 2.74/21.33 % ------
% 2.74/21.33
% 2.74/21.33
% 2.74/21.33 %
% 2.74/21.33
% 2.74/21.33 % ------ Proving...
% 2.74/21.33 %
% 2.74/21.33
% 2.74/21.33 % SZS status Unsatisfiable for theBenchmark.p
% 2.74/21.33
% 2.74/21.33 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.74/21.33
% 2.74/21.33
%------------------------------------------------------------------------------