%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : COM221_1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n008.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 01:04:36 PM UTC 2026
% Result : Theorem 4.27s 1.31s
% Output : CNFRefutation 4.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 29 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 103 ( 22 equ)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 89 ( 38 ~; 35 |; 12 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of FOOLs : 23 ( 23 fml; 0 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 4 prp; 0-3 aty)
% Number of functors : 48 ( 48 usr; 9 con; 0-3 aty)
% Number of variables : 39 ( 0 sgn 35 !; 4 ?; 39 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_0,type,
vNat: vTy ).
tff(pred_def_1,type,
visValue: vTerm > $o ).
tff(pred_def_2,type,
visNV: vTerm > $o ).
tff(pred_def_3,type,
visSomeTerm: vOptTerm > $o ).
tff(pred_def_4,type,
vptchecksimple: ( vTy * vTerm ) > $o ).
tff(pred_def_5,type,
sP0: ( vTerm * ( vTerm * vTerm ) ) > $o ).
tff(func_def_6,type,
vTrue: vTerm ).
tff(func_def_7,type,
vFalse: vTerm ).
tff(func_def_8,type,
vnoTerm: vOptTerm ).
tff(func_def_9,type,
vPlus: ( vTerm * vTerm ) > vTerm ).
tff(func_def_10,type,
vt2: vTerm ).
tff(func_def_11,type,
vB: vTy ).
tff(func_def_12,type,
vIfelse: ( vTerm * ( vTerm * vTerm ) ) > vTerm ).
tff(func_def_13,type,
vt1: vTerm ).
tff(func_def_14,type,
vreduce: vTerm > vOptTerm ).
tff(func_def_15,type,
vplusop: ( vTerm * vTerm ) > vTerm ).
tff(func_def_16,type,
vgetTerm: vOptTerm > vTerm ).
tff(func_def_17,type,
sK1: vTy ).
tff(func_def_18,type,
sK2: vTerm ).
tff(func_def_19,type,
sK3: vOptTerm > vTerm ).
tff(func_def_20,type,
sK4: vTerm > vTerm ).
tff(func_def_21,type,
sK5: vTerm > vTerm ).
tff(func_def_22,type,
sK6: vTerm > vTerm ).
tff(func_def_23,type,
sK7: vTerm > vTerm ).
tff(func_def_24,type,
sK8: vTerm > vTerm ).
tff(func_def_25,type,
sK9: vTerm > vTerm ).
tff(func_def_26,type,
sK10: vTerm > vTerm ).
tff(func_def_27,type,
sK11: vTerm > vTerm ).
tff(func_def_28,type,
sK12: vTerm > vTerm ).
tff(func_def_29,type,
sK13: vTerm > vTerm ).
tff(func_def_30,type,
sK14: vTerm > vTerm ).
tff(func_def_31,type,
sK15: vTerm > vTerm ).
tff(func_def_32,type,
sK16: vTerm > vTerm ).
tff(func_def_33,type,
sK17: vTerm > vTerm ).
tff(func_def_34,type,
sK18: vTerm > vTerm ).
tff(func_def_35,type,
sK19: vTerm > vTerm ).
tff(func_def_36,type,
sK20: vTerm > vTerm ).
tff(func_def_37,type,
sK21: vTerm > vTerm ).
tff(func_def_38,type,
sK22: vTerm > vTerm ).
tff(func_def_39,type,
sK23: vTerm > vTerm ).
tff(func_def_40,type,
sK24: vTerm > vTerm ).
tff(func_def_41,type,
sK25: vTerm > vTerm ).
tff(func_def_42,type,
sK26: vTerm > vTerm ).
tff(func_def_43,type,
sK27: vTerm > vTerm ).
tff(func_def_44,type,
sK28: vTerm > vTerm ).
tff(func_def_45,type,
sK29: vTerm > vTerm ).
tff(func_def_46,type,
sK30: vTerm > vTerm ).
tff(func_def_47,type,
sK31: ( vTerm * ( vTerm * vTerm ) ) > vTerm ).
tff(func_def_48,type,
sK32: ( vTerm * ( vTerm * vTerm ) ) > vTerm ).
tff(func_def_49,type,
sK33: ( vTerm * ( vTerm * vTerm ) ) > vTerm ).
tff(func_def_50,type,
sK34: ( vTerm * ( vTerm * vTerm ) ) > vTerm ).
tff(func_def_51,type,
sK35: vTerm > vTerm ).
tff(func_def_52,type,
sK36: vOptTerm > vTerm ).
tff(f107,axiom,
! [X0: vTy,X1: vTerm] :
( ( ( vreduce(vPlus(vt1,vt2)) = vsomeTerm(X1) )
& vptchecksimple(vPlus(vt1,vt2),X0)
& visNV(vt1) )
=> vptchecksimple(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Preservation-Plus-isNV-True') ).
tff(f108,axiom,
! [X0: vTy,X1: vTerm] :
( ( ( vreduce(vPlus(vt1,vt2)) = vsomeTerm(X1) )
& vptchecksimple(vPlus(vt1,vt2),X0)
& ~ visNV(vt1) )
=> vptchecksimple(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Preservation-Plus-isNV-False') ).
tff(f109,conjecture,
! [X0: vTy,X1: vTerm] :
( ( ( vreduce(vPlus(vt1,vt2)) = vsomeTerm(X1) )
& vptchecksimple(vPlus(vt1,vt2),X0) )
=> vptchecksimple(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Preservation-Plus') ).
tff(f110,negated_conjecture,
~ ! [X0: vTy,X1: vTerm] :
( ( ( vreduce(vPlus(vt1,vt2)) = vsomeTerm(X1) )
& vptchecksimple(vPlus(vt1,vt2),X0) )
=> vptchecksimple(X1,X0) ),
inference(negated_conjecture,[status(cth)],[f109]) ).
tff(f113,plain,
? [X0: vTy,X1: vTerm] :
( ( vreduce(vPlus(vt1,vt2)) = vsomeTerm(X1) )
& vptchecksimple(vPlus(vt1,vt2),X0)
& ~ vptchecksimple(X1,X0) ),
inference(ennf_transformation,[],[f110]) ).
tff(f114,plain,
? [X0: vTy,X1: vTerm] :
( ( vreduce(vPlus(vt1,vt2)) = vsomeTerm(X1) )
& vptchecksimple(vPlus(vt1,vt2),X0)
& ~ vptchecksimple(X1,X0) ),
inference(flattening,[],[f113]) ).
tff(f127,plain,
! [X0: vTy,X1: vTerm] :
( ( vsomeTerm(X1) != vreduce(vPlus(vt1,vt2)) )
| ~ vptchecksimple(vPlus(vt1,vt2),X0)
| visNV(vt1)
| vptchecksimple(X1,X0) ),
inference(ennf_transformation,[],[f108]) ).
tff(f128,plain,
! [X0: vTy,X1: vTerm] :
( ( vsomeTerm(X1) != vreduce(vPlus(vt1,vt2)) )
| ~ vptchecksimple(vPlus(vt1,vt2),X0)
| visNV(vt1)
| vptchecksimple(X1,X0) ),
inference(flattening,[],[f127]) ).
tff(f129,plain,
! [X0: vTy,X1: vTerm] :
( ( vsomeTerm(X1) != vreduce(vPlus(vt1,vt2)) )
| ~ vptchecksimple(vPlus(vt1,vt2),X0)
| ~ visNV(vt1)
| vptchecksimple(X1,X0) ),
inference(ennf_transformation,[],[f107]) ).
tff(f130,plain,
! [X0: vTy,X1: vTerm] :
( ( vsomeTerm(X1) != vreduce(vPlus(vt1,vt2)) )
| ~ vptchecksimple(vPlus(vt1,vt2),X0)
| ~ visNV(vt1)
| vptchecksimple(X1,X0) ),
inference(flattening,[],[f129]) ).
tff(f172,plain,
( ( vreduce(vPlus(vt1,vt2)) = vsomeTerm(sK2) )
& vptchecksimple(vPlus(vt1,vt2),sK1)
& ~ vptchecksimple(sK2,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X0,sK1),skolemize(X1,sK2)],[f114]) ).
tff(f187,plain,
vreduce(vPlus(vt1,vt2)) = vsomeTerm(sK2),
inference(cnf_transformation,[],[f172]) ).
tff(f188,plain,
vptchecksimple(vPlus(vt1,vt2),sK1),
inference(cnf_transformation,[],[f172]) ).
tff(f189,plain,
~ vptchecksimple(sK2,sK1),
inference(cnf_transformation,[],[f172]) ).
tff(f215,plain,
! [X0: vTy,X1: vTerm] :
( ( vsomeTerm(X1) != vreduce(vPlus(vt1,vt2)) )
| ~ vptchecksimple(vPlus(vt1,vt2),X0)
| visNV(vt1)
| vptchecksimple(X1,X0) ),
inference(cnf_transformation,[],[f128]) ).
tff(f216,plain,
! [X0: vTy,X1: vTerm] :
( ( vsomeTerm(X1) != vreduce(vPlus(vt1,vt2)) )
| ~ vptchecksimple(vPlus(vt1,vt2),X0)
| ~ visNV(vt1)
| vptchecksimple(X1,X0) ),
inference(cnf_transformation,[],[f130]) ).
tcf(c_49,negated_conjecture,
~ vptchecksimple(sK2,sK1),
inference(cnf_transformation,[],[f189]) ).
tcf(c_50,negated_conjecture,
vptchecksimple(vPlus(vt1,vt2),sK1),
inference(cnf_transformation,[],[f188]) ).
tcf(c_51,negated_conjecture,
vreduce(vPlus(vt1,vt2)) = vsomeTerm(sK2),
inference(cnf_transformation,[],[f187]) ).
tcf(c_77,plain,
! [X0_vTerm: vTerm,X0_vTy: vTy] :
( visNV(vt1)
| vptchecksimple(X0_vTerm,X0_vTy)
| ~ vptchecksimple(vPlus(vt1,vt2),X0_vTy)
| ( vreduce(vPlus(vt1,vt2)) != vsomeTerm(X0_vTerm) ) ),
inference(cnf_transformation,[],[f215]) ).
tcf(c_78,plain,
! [X0_vTerm: vTerm,X0_vTy: vTy] :
( vptchecksimple(X0_vTerm,X0_vTy)
| ~ visNV(vt1)
| ~ vptchecksimple(vPlus(vt1,vt2),X0_vTy)
| ( vreduce(vPlus(vt1,vt2)) != vsomeTerm(X0_vTerm) ) ),
inference(cnf_transformation,[],[f216]) ).
tcf(c_207,plain,
! [X0_vTerm: vTerm,X0_vTy: vTy] :
( ( vreduce(vPlus(vt1,vt2)) != vsomeTerm(X0_vTerm) )
| ~ vptchecksimple(vPlus(vt1,vt2),X0_vTy)
| vptchecksimple(X0_vTerm,X0_vTy) ),
inference(global_subsumption_just,[status(thm)],[c_77,c_77,c_78]) ).
tcf(c_208,plain,
! [X0_vTerm: vTerm,X0_vTy: vTy] :
( vptchecksimple(X0_vTerm,X0_vTy)
| ~ vptchecksimple(vPlus(vt1,vt2),X0_vTy)
| ( vreduce(vPlus(vt1,vt2)) != vsomeTerm(X0_vTerm) ) ),
inference(renaming,[status(thm)],[c_207]) ).
tcf(c_209,plain,
! [X0_vTerm: vTerm,X0_vTy: vTy] :
( vptchecksimple(X0_vTerm,X0_vTy)
| ( vreduce(vPlus(vt1,vt2)) != vsomeTerm(X0_vTerm) )
| ~ vptchecksimple(vPlus(vt1,vt2),X0_vTy) ),
inference(global_subsumption_just,[status(thm)],[c_78,c_208]) ).
tcf(c_210,plain,
! [X0_vTerm: vTerm,X0_vTy: vTy] :
( vptchecksimple(X0_vTerm,X0_vTy)
| ~ vptchecksimple(vPlus(vt1,vt2),X0_vTy)
| ( vreduce(vPlus(vt1,vt2)) != vsomeTerm(X0_vTerm) ) ),
inference(renaming,[status(thm)],[c_209]) ).
tcf(c_1086,plain,
! [X0_vTerm: vTerm,X0_vTy: vTy] :
( vptchecksimple(X0_vTerm,X0_vTy)
| ~ vptchecksimple(vPlus(vt1,vt2),X0_vTy)
| ( vsomeTerm(X0_vTerm) != vsomeTerm(sK2) ) ),
inference(light_normalisation,[status(thm)],[c_210,c_51]) ).
tcf(c_3941,plain,
! [X0_vTy: vTy] :
( vptchecksimple(sK2,X0_vTy)
| ~ vptchecksimple(vPlus(vt1,vt2),X0_vTy) ),
inference(equality_resolution,[status(thm)],[c_1086]) ).
tcf(c_3949,plain,
vptchecksimple(sK2,sK1),
inference(superposition,[status(thm)],[c_50,c_3941]) ).
tcf(c_3950,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3949,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM221_1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.38 % Computer : n008.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Fri Sep 25 08:01:39 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/0.42 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.13/0.43
% 0.13/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.43
% 0.13/0.43 % Detected problem language: tptp
% 0.13/0.44 % Proving...
% 4.27/1.31 % SZS status Started for theBenchmark.p
% 4.27/1.31 % SZS status Theorem for theBenchmark.p
% 4.27/1.31
% 4.27/1.31 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.27/1.31
% 4.27/1.31 % ------ iProver source info
% 4.27/1.31
% 4.27/1.31 % git: date: 2026-07-19 20:42:38 +0200
% 4.27/1.31 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.27/1.31 % git: non_committed_changes: false
% 4.27/1.31
% 4.27/1.31 % ------ Parsing...
% 4.27/1.31 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Global Options Modified: tff_prep: switching off prep_sem_filter, sub_typing, pure_diseq_elim
% 4.27/1.31 %
% 4.27/1.31
% 4.27/1.31 % ------ Preprocessing... sup_sim: 1 pe_s pe_e sup_sim: 0 pe_s pe_e %
% 4.27/1.31
% 4.27/1.31 % ------ Preprocessing...% ------ preprocesses with Global Options Modified: tff_prep: switching off prep_sem_filter, sub_typing, pure_diseq_elim
% 4.27/1.31 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e % ------ preprocesses with Global Options Modified: tff_prep: switching off prep_sem_filter, sub_typing, pure_diseq_elim
% 4.27/1.31 %
% 4.27/1.31
% 4.27/1.31 % ------ Preprocessing...
% 4.27/1.31 % ------ Proving...
% 4.27/1.31 % ------ Problem Properties
% 4.27/1.31
% 4.27/1.31 %
% 4.27/1.31 % clauses 96
% 4.27/1.31 % conjectures 3
% 4.27/1.31 % EPR 10
% 4.27/1.31 % Horn 75
% 4.27/1.31 % unary 40
% 4.27/1.31 % binary 32
% 4.27/1.31 % lits 196
% 4.27/1.31 % lits eq 119
% 4.27/1.31 % fd_pure 0
% 4.27/1.31 % fd_pseudo 0
% 4.27/1.31 % fd_cond 8
% 4.27/1.31 % fd_pseudo_cond 9
% 4.27/1.31 % AC symbols 0
% 4.27/1.31
% 4.27/1.31 % ------ Schedule dynamic 5 is on
% 4.27/1.31
% 4.27/1.31 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.27/1.31
% 4.27/1.31
% 4.27/1.31 % ------
% 4.27/1.31 % Current options:
% 4.27/1.31 % ------
% 4.27/1.31
% 4.27/1.31
% 4.27/1.31 %
% 4.27/1.31
% 4.27/1.31 % ------ Proving...
% 4.27/1.31 %
% 4.27/1.31
% 4.27/1.31 % SZS status Theorem for theBenchmark.p
% 4.27/1.31
% 4.27/1.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.27/1.31
% 4.27/1.31
%------------------------------------------------------------------------------