%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : COM214_1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n006.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:35 PM UTC 2026
% Result : Theorem 3.46s 1.19s
% Output : CNFRefutation 3.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 12 unt; 0 typ; 0 def)
% Number of atoms : 108 ( 27 equ)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 39 ( 15 ~; 12 |; 9 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of FOOLs : 60 ( 60 fml; 0 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 38 ( 36 usr; 6 prp; 0-3 aty)
% Number of functors : 84 ( 84 usr; 2 con; 0-3 aty)
% Number of variables : 22 ( 0 sgn 18 !; 4 ?; 22 :)
% 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 ) > $o ).
tff(pred_def_6,type,
sP1: ( vTerm * vTerm ) > $o ).
tff(pred_def_7,type,
sP2: ( vTerm * ( vTerm * vTerm ) ) > $o ).
tff(pred_def_8,type,
sP3: ( vTerm * ( vTerm * vTerm ) ) > $o ).
tff(pred_def_9,type,
sP4: vTerm > $o ).
tff(pred_def_10,type,
sP5: vTerm > $o ).
tff(pred_def_11,type,
sP6: vTerm > $o ).
tff(pred_def_12,type,
sP7: vTerm > $o ).
tff(pred_def_13,type,
sP8: vTerm > $o ).
tff(pred_def_14,type,
sP9: vTerm > $o ).
tff(pred_def_15,type,
sP10: vTerm > $o ).
tff(pred_def_16,type,
sP11: vTerm > $o ).
tff(pred_def_17,type,
sP12: vTerm > $o ).
tff(pred_def_18,type,
sP13: vTerm > $o ).
tff(pred_def_19,type,
sP14: vTerm > $o ).
tff(pred_def_20,type,
sP15: vTerm > $o ).
tff(pred_def_21,type,
sP16: vTerm > $o ).
tff(pred_def_22,type,
sP17: vTerm > $o ).
tff(pred_def_23,type,
sP18: vTerm > $o ).
tff(pred_def_24,type,
sP19: vTerm > $o ).
tff(pred_def_25,type,
sP20: vTerm > $o ).
tff(pred_def_26,type,
sP21: vTerm > $o ).
tff(pred_def_27,type,
sP22: vTerm > $o ).
tff(pred_def_28,type,
sP23: vTerm > $o ).
tff(pred_def_29,type,
sP24: vTerm > $o ).
tff(func_def_30,type,
sK40: vOptTerm > vTerm ).
tff(func_def_31,type,
sK41: vTerm > vTerm ).
tff(func_def_32,type,
sK42: ( vTerm * vTerm ) > vTerm ).
tff(func_def_33,type,
sK43: ( vTerm * vTerm ) > vTerm ).
tff(func_def_34,type,
sK44: ( vTerm * vTerm ) > vTerm ).
tff(func_def_35,type,
sK45: ( vTerm * vTerm ) > vTerm ).
tff(func_def_36,type,
sK46: ( vTerm * vTerm ) > vTerm ).
tff(func_def_37,type,
sK47: ( vTerm * ( vTerm * vTerm ) ) > vTerm ).
tff(func_def_38,type,
sK48: ( vTerm * ( vTerm * vTerm ) ) > vTerm ).
tff(func_def_39,type,
sK49: ( vTerm * ( vTerm * vTerm ) ) > vTerm ).
tff(func_def_40,type,
sK50: ( vTerm * ( vTerm * vTerm ) ) > vTerm ).
tff(func_def_41,type,
sK51: ( vTerm * ( vTerm * vTerm ) ) > vTerm ).
tff(func_def_42,type,
sK52: ( vTerm * ( vTerm * vTerm ) ) > vTerm ).
tff(func_def_43,type,
sK53: ( vTerm * ( vTerm * vTerm ) ) > vTerm ).
tff(func_def_44,type,
sK54: ( vTerm * ( vTerm * vTerm ) ) > vTerm ).
tff(func_def_45,type,
sK55: vTerm > vTerm ).
tff(func_def_46,type,
sK56: vTerm > vTerm ).
tff(func_def_47,type,
sK57: vTerm > vTerm ).
tff(func_def_48,type,
sK58: vTerm > vTerm ).
tff(func_def_49,type,
sK59: vTerm > vTerm ).
tff(func_def_50,type,
sK60: vTerm > vTerm ).
tff(func_def_51,type,
sK61: vTerm > vTerm ).
tff(func_def_52,type,
sK62: vTerm > vTerm ).
tff(func_def_53,type,
sK63: vTerm > vTerm ).
tff(func_def_54,type,
sK64: vTerm > vTerm ).
tff(func_def_55,type,
sK65: vTerm > vTerm ).
tff(func_def_56,type,
sK66: vTerm > vTerm ).
tff(func_def_57,type,
sK67: vTerm > vTerm ).
tff(func_def_58,type,
sK68: vTerm > vTerm ).
tff(func_def_59,type,
sK69: vTerm > vTerm ).
tff(func_def_60,type,
sK70: vTerm > vTerm ).
tff(func_def_61,type,
sK71: vTerm > vTerm ).
tff(func_def_62,type,
sK72: vTerm > vTerm ).
tff(func_def_63,type,
sK73: vTerm > vTerm ).
tff(func_def_64,type,
sK74: vTerm > vTerm ).
tff(func_def_65,type,
sK75: vTerm > vTerm ).
tff(func_def_66,type,
sK76: vTerm > vOptTerm ).
tff(func_def_67,type,
sK77: vTerm > vTerm ).
tff(func_def_68,type,
sK78: vTerm > vOptTerm ).
tff(func_def_69,type,
sK79: vTerm > vTerm ).
tff(func_def_70,type,
sK80: vTerm > vTerm ).
tff(func_def_71,type,
sK81: vTerm > vTerm ).
tff(func_def_72,type,
sK82: vTerm > vOptTerm ).
tff(func_def_73,type,
sK83: vTerm > vTerm ).
tff(func_def_74,type,
sK84: vTerm > vOptTerm ).
tff(func_def_75,type,
sK85: vTerm > vTerm ).
tff(func_def_76,type,
sK86: vTerm > vOptTerm ).
tff(func_def_77,type,
sK87: vTerm > vTerm ).
tff(func_def_78,type,
sK88: vTerm > vOptTerm ).
tff(func_def_79,type,
sK89: vTerm > vTerm ).
tff(func_def_80,type,
sK90: vTerm > vTerm ).
tff(func_def_81,type,
sK91: vTerm > vOptTerm ).
tff(func_def_82,type,
sK92: vTerm > vTerm ).
tff(func_def_83,type,
sK93: vTerm > vTerm ).
tff(func_def_84,type,
sK94: vTerm > vOptTerm ).
tff(func_def_85,type,
sK95: vTerm > vTerm ).
tff(func_def_86,type,
sK96: vTerm > vTerm ).
tff(func_def_87,type,
sK97: vTerm > vTerm ).
tff(func_def_88,type,
sK98: vTerm > vOptTerm ).
tff(func_def_89,type,
sK99: vTerm > vTerm ).
tff(func_def_90,type,
sK100: vTerm > vTerm ).
tff(func_def_91,type,
sK101: vTerm > vTerm ).
tff(func_def_92,type,
sK102: vTerm > vOptTerm ).
tff(func_def_93,type,
sK103: vTerm > vTerm ).
tff(func_def_94,type,
sK104: vTerm > vOptTerm ).
tff(func_def_95,type,
sK105: vTerm > vTerm ).
tff(func_def_96,type,
sK106: vTerm > vOptTerm ).
tff(func_def_97,type,
sK107: vTerm > vTerm ).
tff(func_def_98,type,
sK108: vTerm > vOptTerm ).
tff(func_def_99,type,
sK109: vTerm > vTerm ).
tff(func_def_100,type,
sK110: vTerm > vOptTerm ).
tff(func_def_101,type,
sK111: vTerm > vTerm ).
tff(func_def_102,type,
sK112: vTerm > vTerm ).
tff(func_def_103,type,
sK113: vTerm > vOptTerm ).
tff(func_def_104,type,
sK114: vTerm > vTerm ).
tff(func_def_105,type,
sK115: vTerm > vTerm ).
tff(func_def_106,type,
sK116: vTerm > vOptTerm ).
tff(func_def_107,type,
sK117: vTerm > vTerm ).
tff(func_def_108,type,
sK118: vTerm > vTerm ).
tff(func_def_109,type,
sK119: vTerm > vTerm ).
tff(func_def_110,type,
sK120: vTerm > vTerm ).
tff(func_def_111,type,
sK121: vTerm > vTerm ).
tff(func_def_112,type,
sK122: vTerm ).
tff(f15,axiom,
vFalse != vZero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p','DIFF-False-Zero') ).
tff(f16,axiom,
! [X0: vTerm] : ( vFalse != vSucc(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','DIFF-False-Succ') ).
tff(f57,axiom,
! [X0: vTerm,X1: vTerm] :
( ( ! [X2: vTerm] : ( X0 != vSucc(X2) )
& ( X0 != vZero ) )
=> ( vplusop(X1,X0) = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','plusop-2') ).
tff(f105,conjecture,
! [X0: vTerm] :
( ( vptchecksimple(vFalse,vNat)
& vptchecksimple(X0,vNat) )
=> vptchecksimple(vplusop(X0,vFalse),vNat) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','PlusPreservation-False') ).
tff(f106,negated_conjecture,
~ ! [X0: vTerm] :
( ( vptchecksimple(vFalse,vNat)
& vptchecksimple(X0,vNat) )
=> vptchecksimple(vplusop(X0,vFalse),vNat) ),
inference(negated_conjecture,[status(cth)],[f105]) ).
tff(f128,plain,
! [X0: vTerm,X1: vTerm] :
( ? [X2: vTerm] : ( vSucc(X2) = X0 )
| ( vZero = X0 )
| ( vplusop(X1,X0) = X0 ) ),
inference(ennf_transformation,[],[f57]) ).
tff(f129,plain,
! [X0: vTerm,X1: vTerm] :
( ? [X2: vTerm] : ( vSucc(X2) = X0 )
| ( vZero = X0 )
| ( vplusop(X1,X0) = X0 ) ),
inference(flattening,[],[f128]) ).
tff(f186,plain,
? [X0: vTerm] :
( vptchecksimple(vFalse,vNat)
& vptchecksimple(X0,vNat)
& ~ vptchecksimple(vplusop(X0,vFalse),vNat) ),
inference(ennf_transformation,[],[f106]) ).
tff(f187,plain,
? [X0: vTerm] :
( vptchecksimple(vFalse,vNat)
& vptchecksimple(X0,vNat)
& ~ vptchecksimple(vplusop(X0,vFalse),vNat) ),
inference(flattening,[],[f186]) ).
tff(f227,plain,
! [X0: vTerm,X1: vTerm] :
( ( vSucc(sK41(X0)) = X0 )
| ( vZero = X0 )
| ( vplusop(X1,X0) = X0 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK41]),skolemize(X2,sK41(X0))],[f129]) ).
tff(f310,plain,
( vptchecksimple(vFalse,vNat)
& vptchecksimple(sK122,vNat)
& ~ vptchecksimple(vplusop(sK122,vFalse),vNat) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK122]),skolemize(X0,sK122)],[f187]) ).
tff(f328,plain,
vFalse != vZero,
inference(cnf_transformation,[],[f15]) ).
tff(f329,plain,
! [X0: vTerm] : ( vFalse != vSucc(X0) ),
inference(cnf_transformation,[],[f16]) ).
tff(f384,plain,
! [X0: vTerm,X1: vTerm] :
( ( vSucc(sK41(X0)) = X0 )
| ( vZero = X0 )
| ( vplusop(X1,X0) = X0 ) ),
inference(cnf_transformation,[],[f227]) ).
tff(f570,plain,
vptchecksimple(vFalse,vNat),
inference(cnf_transformation,[],[f310]) ).
tff(f572,plain,
~ vptchecksimple(vplusop(sK122,vFalse),vNat),
inference(cnf_transformation,[],[f310]) ).
tcf(c_66,plain,
vZero != vFalse,
inference(cnf_transformation,[],[f328]) ).
tcf(c_67,plain,
! [X0_vTerm: vTerm] : vSucc(X0_vTerm) != vFalse,
inference(cnf_transformation,[],[f329]) ).
tcf(c_122,plain,
! [X0_vTerm: vTerm,X1_vTerm: vTerm] :
( ( X1_vTerm = vZero )
| ( vSucc(sK41(X1_vTerm)) = X1_vTerm )
| ( vplusop(X0_vTerm,X1_vTerm) = X1_vTerm ) ),
inference(cnf_transformation,[],[f384]) ).
tcf(c_308,negated_conjecture,
~ vptchecksimple(vplusop(sK122,vFalse),vNat),
inference(cnf_transformation,[],[f572]) ).
tcf(c_310,negated_conjecture,
vptchecksimple(vFalse,vNat),
inference(cnf_transformation,[],[f570]) ).
tcf(c_405,plain,
( ( vZero = vFalse )
| ( vSucc(sK41(vFalse)) = vFalse )
| ~ vptchecksimple(vFalse,vNat) ),
inference(superposition,[status(thm)],[c_122,c_308]) ).
tcf(c_407,plain,
vSucc(sK41(vFalse)) = vFalse,
inference(global_subsumption_just,[status(thm)],[c_405,c_310,c_66,c_405]) ).
tcf(c_409,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_407,c_67]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM214_1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.36 % Computer : n006.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Fri Sep 25 08:00:10 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/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.11/0.41
% 0.11/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.41
% 0.11/0.42 % Detected problem language: tptp
% 0.11/0.43 % Proving...
% 3.46/1.19 % SZS status Started for theBenchmark.p
% 3.46/1.19 % SZS status Theorem for theBenchmark.p
% 3.46/1.19
% 3.46/1.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.46/1.19
% 3.46/1.19 % ------ iProver source info
% 3.46/1.19
% 3.46/1.19 % git: date: 2026-07-19 20:42:38 +0200
% 3.46/1.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.46/1.19 % git: non_committed_changes: false
% 3.46/1.19
% 3.46/1.19 % ------ Parsing...
% 3.46/1.19 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.46/1.19 % ------ Proving...
% 3.46/1.19 % ------ Problem Properties
% 3.46/1.19
% 3.46/1.19 %
% 3.46/1.19 % clauses 262
% 3.46/1.19 % conjectures 3
% 3.46/1.19 % EPR 21
% 3.46/1.19 % Horn 212
% 3.46/1.19 % unary 48
% 3.46/1.19 % binary 164
% 3.46/1.19 % lits 727
% 3.46/1.19 % lits eq 280
% 3.46/1.19 % fd_pure 1
% 3.46/1.19 % fd_pseudo 0
% 3.46/1.19 % fd_cond 19
% 3.46/1.19 % fd_pseudo_cond 9
% 3.46/1.19 % AC symbols 0
% 3.46/1.19
% 3.46/1.19 % ------ Input Options Time Limit: Unbounded
% 3.46/1.19
% 3.46/1.19
% 3.46/1.19 % ------
% 3.46/1.19 % Current options:
% 3.46/1.19 % ------
% 3.46/1.19
% 3.46/1.19
% 3.46/1.19 %
% 3.46/1.19
% 3.46/1.19 % ------ Proving...
% 3.46/1.19 %
% 3.46/1.19
% 3.46/1.19 % SZS status Theorem for theBenchmark.p
% 3.46/1.19
% 3.46/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.46/1.19
% 3.46/1.19
%------------------------------------------------------------------------------