%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV267-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n002.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 03:16:52 PM UTC 2026
% Result : Unsatisfiable 0.33s 6.40s
% Output : CNFRefutation 0.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 20 ( 15 unt; 3 def)
% Number of atoms : 49 ( 3 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 21 ( 12 ~; 9 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 4 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 18 ( 0 sgn 18 !; 0 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
c_lessequals(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
fof(f2,negated_conjecture,
~ c_lessequals(v_G,c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
fof(f3,axiom,
! [X0] : c_lessequals(X0,c_Message_Oparts(X0),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_Oparts__increasing_0) ).
fof(f4,axiom,
! [X2,X3,X0,X1] :
( c_lessequals(X3,X1,tc_set(X2))
| ~ c_lessequals(X3,X0,tc_set(X2))
| ~ c_lessequals(X0,X1,tc_set(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_Osubset__trans_0) ).
tcf(c_53,negated_conjecture,
c_lessequals(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
inference(cnf_transformation,[],[f1]) ).
tcf(c_54,negated_conjecture,
~ c_lessequals(v_G,c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
inference(cnf_transformation,[],[f2]) ).
tcf(c_55,plain,
! [X0: $i] : c_lessequals(X0,c_Message_Oparts(X0),tc_set(tc_Message_Omsg)),
inference(cnf_transformation,[],[f3]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( c_lessequals(X3,X1,tc_set(X2))
| ~ c_lessequals(X3,X0,tc_set(X2))
| ~ c_lessequals(X0,X1,tc_set(X2)) ),
inference(cnf_transformation,[],[f4]) ).
tcf(c_70,definition,
iPr_def_10 = c_Message_Oparts(v_H),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_71,definition,
iPr_def_11 = tc_set(tc_Message_Omsg),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_72,definition,
iPr_def_12 = c_Message_Oparts(v_G),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_73,negated_conjecture,
~ c_lessequals(v_G,iPr_def_10,iPr_def_11),
inference(demodulation,[status(thm)],[c_54,c_71,c_70]) ).
tcf(c_74,negated_conjecture,
c_lessequals(iPr_def_12,iPr_def_10,iPr_def_11),
inference(demodulation,[status(thm)],[c_53,c_72]) ).
tcf(c_175,plain,
! [X0: $i] : c_lessequals(X0,c_Message_Oparts(X0),iPr_def_11),
inference(light_normalisation,[status(thm)],[c_55,c_71]) ).
tcf(c_176,plain,
c_lessequals(v_G,iPr_def_12,iPr_def_11),
inference(superposition,[status(thm)],[c_72,c_175]) ).
tcf(c_181,plain,
! [X0: $i,X1: $i,X2: $i] :
( c_lessequals(X0,X2,tc_set(tc_Message_Omsg))
| ~ c_lessequals(X1,X2,iPr_def_11)
| ~ c_lessequals(X0,X1,tc_set(tc_Message_Omsg)) ),
inference(superposition,[status(thm)],[c_71,c_56]) ).
tcf(c_182,plain,
! [X0: $i,X1: $i,X2: $i] :
( c_lessequals(X0,X2,iPr_def_11)
| ~ c_lessequals(X1,X2,iPr_def_11)
| ~ c_lessequals(X0,X1,iPr_def_11) ),
inference(light_normalisation,[status(thm)],[c_181,c_71]) ).
tcf(c_194,plain,
! [X0: $i] :
( c_lessequals(v_G,X0,iPr_def_11)
| ~ c_lessequals(iPr_def_12,X0,iPr_def_11) ),
inference(superposition,[status(thm)],[c_176,c_182]) ).
tcf(c_314,plain,
c_lessequals(v_G,iPr_def_10,iPr_def_11),
inference(superposition,[status(thm)],[c_74,c_194]) ).
tcf(c_323,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_314,c_73]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV267-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/5.58 % Computer : n002.cluster.edu
% 0.10/5.58 % Model : x86_64 x86_64
% 0.10/5.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.58 % Memory : 8046.5625MB
% 0.10/5.58 % OS : Linux 6.8.0-71-generic
% 0.10/5.58 % CPULimit : 300
% 0.10/5.58 % WCLimit : 300
% 0.10/5.58 % DateTime : Thu Sep 24 18:59:56 UTC 2026
% 0.10/5.59 % CPUTime :
% 0.10/5.59 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/5.62 Running first-order theorem proving
% 0.15/5.62 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.15/5.63
% 0.15/5.63 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.63
% 0.15/5.63 % Detected problem language: tptp
% 0.15/5.64 % Proving...
% 0.33/6.40 % SZS status Started for theBenchmark.p
% 0.33/6.40 % SZS status Unsatisfiable for theBenchmark.p
% 0.33/6.40
% 0.33/6.40 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.33/6.40
% 0.33/6.40 % ------ iProver source info
% 0.33/6.40
% 0.33/6.40 % git: date: 2026-07-19 20:42:38 +0200
% 0.33/6.40 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.33/6.40 % git: non_committed_changes: false
% 0.33/6.40
% 0.33/6.40 % ------ Parsing...% successful
% 0.33/6.40
% 0.33/6.40
% 0.33/6.40 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.33/6.40
% 0.33/6.40 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 0.33/6.40
% 0.33/6.40 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.33/6.40
% 0.33/6.40 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.33/6.40 % ------ Proving...
% 0.33/6.40 % ------ Problem Properties
% 0.33/6.40
% 0.33/6.40 %
% 0.33/6.40 % clauses 7
% 0.33/6.40 % conjectures 2
% 0.33/6.40 % EPR 2
% 0.33/6.40 % Horn 7
% 0.33/6.40 % unary 6
% 0.33/6.40 % binary 0
% 0.33/6.40 % lits 9
% 0.33/6.40 % lits eq 3
% 0.33/6.40 % fd_pure 0
% 0.33/6.40 % fd_pseudo 0
% 0.33/6.40 % fd_cond 0
% 0.33/6.40 % fd_pseudo_cond 0
% 0.33/6.40 % AC symbols 0
% 0.33/6.40
% 0.33/6.40 % ------ Schedule dynamic 5 is on
% 0.33/6.40
% 0.33/6.40 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.33/6.40
% 0.33/6.40
% 0.33/6.40 % ------
% 0.33/6.40 % Current options:
% 0.33/6.40 % ------
% 0.33/6.40
% 0.33/6.40
% 0.33/6.40 %
% 0.33/6.40
% 0.33/6.40 % ------ Proving...
% 0.33/6.40 %
% 0.33/6.40
% 0.33/6.40 % SZS status Unsatisfiable for theBenchmark.p
% 0.33/6.40
% 0.33/6.40 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.33/6.40
% 0.33/6.40
%------------------------------------------------------------------------------