%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GEG015^1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n019.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 : Wed Sep 30 07:49:22 AM UTC 2026
% Result : Theorem 0.22s 0.30s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 10
% Syntax : Number of formulae : 46 ( 27 unt; 0 typ; 0 def)
% Number of atoms : 268 ( 21 equ; 0 cnn)
% Maximal formula atoms : 35 ( 5 avg)
% Number of connectives : 782 ( 86 ~; 79 |; 58 &; 519 @)
% ( 0 <=>; 40 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 21 ( 19 usr; 6 con; 0-3 aty)
% Number of variables : 151 ( 45 ^; 85 !; 21 ?; 151 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
reg: $tType ).
thf(decl_38,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_50,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_54,type,
c: reg > reg > $o ).
thf(decl_56,type,
p: reg > reg > $o ).
thf(decl_57,type,
eq: reg > reg > $o ).
thf(decl_58,type,
o: reg > reg > $o ).
thf(decl_60,type,
ec: reg > reg > $o ).
thf(decl_61,type,
pp: reg > reg > $o ).
thf(decl_63,type,
ntpp: reg > reg > $o ).
thf(decl_65,type,
france: reg ).
thf(decl_67,type,
paris: reg ).
thf(decl_68,type,
a: $i > $i > $o ).
thf(decl_81,type,
esk12_0: reg ).
thf(decl_82,type,
esk13_1: reg > reg ).
thf(decl_83,type,
esk14_1: reg > reg ).
thf(decl_84,type,
esk15_0: $i ).
thf(decl_85,type,
esk16_0: $i ).
thf(decl_86,type,
esk17_2: reg > reg > reg ).
thf(decl_87,type,
esk18_2: reg > reg > reg ).
thf(o,axiom,
( o
= ( ^ [X28: reg,X29: reg] :
? [X25: reg] :
( ( p @ X25 @ X28 )
& ( p @ X25 @ X29 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Tks2WJxyIT/E---3.1_1189833.p',o) ).
thf(p,axiom,
( p
= ( ^ [X23: reg,X24: reg] :
! [X25: reg] :
( ( c @ X25 @ X23 )
=> ( c @ X25 @ X24 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Tks2WJxyIT/E---3.1_1189833.p',p) ).
thf(ec,axiom,
( ec
= ( ^ [X32: reg,X33: reg] :
( ( c @ X32 @ X33 )
& ~ ( o @ X32 @ X33 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Tks2WJxyIT/E---3.1_1189833.p',ec) ).
thf(pp,axiom,
( pp
= ( ^ [X34: reg,X35: reg] :
( ( p @ X34 @ X35 )
& ~ ( p @ X35 @ X34 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Tks2WJxyIT/E---3.1_1189833.p',pp) ).
thf(ntpp,axiom,
( ntpp
= ( ^ [X38: reg,X39: reg] :
( ( pp @ X38 @ X39 )
& ~ ? [X25: reg] :
( ( ec @ X25 @ X38 )
& ( ec @ X25 @ X39 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Tks2WJxyIT/E---3.1_1189833.p',ntpp) ).
thf(eq,axiom,
( eq
= ( ^ [X26: reg,X27: reg] :
( ( p @ X26 @ X27 )
& ( p @ X27 @ X26 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Tks2WJxyIT/E---3.1_1189833.p',eq) ).
thf(mbox,axiom,
( mbox
= ( ^ [X13: $i > $i > $o,X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( X13 @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Tks2WJxyIT/E---3.1_1189833.p',mbox) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Tks2WJxyIT/E---3.1_1189833.p',mvalid) ).
thf(con,conjecture,
( mvalid
@ ( mbox @ a
@ ^ [X44: $i] :
? [X25: reg,X45: reg] :
( ~ ( eq @ X25 @ X45 )
& ( p @ X25 @ france )
& ( p @ X45 @ france ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Tks2WJxyIT/E---3.1_1189833.p',con) ).
thf(ax3,axiom,
( mvalid
@ ( mbox @ a
@ ^ [X43: $i] : ( ntpp @ paris @ france ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Tks2WJxyIT/E---3.1_1189833.p',ax3) ).
thf(c_0_10,plain,
( o
= ( ^ [Z0: reg,Z1: reg] :
? [X25: reg] :
( ! [X54: reg] :
( ( c @ X54 @ X25 )
=> ( c @ X54 @ Z0 ) )
& ! [X55: reg] :
( ( c @ X55 @ X25 )
=> ( c @ X55 @ Z1 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[o]) ).
thf(c_0_11,plain,
( p
= ( ^ [Z0: reg,Z1: reg] :
! [X25: reg] :
( ( c @ X25 @ Z0 )
=> ( c @ X25 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[p]) ).
thf(c_0_12,plain,
( ec
= ( ^ [Z0: reg,Z1: reg] :
( ( c @ Z0 @ Z1 )
& ~ ? [X61: reg] :
( ! [X62: reg] :
( ( c @ X62 @ X61 )
=> ( c @ X62 @ Z0 ) )
& ! [X63: reg] :
( ( c @ X63 @ X61 )
=> ( c @ X63 @ Z1 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[ec]) ).
thf(c_0_13,plain,
( o
= ( ^ [Z0: reg,Z1: reg] :
? [X25: reg] :
( ! [X54: reg] :
( ( c @ X54 @ X25 )
=> ( c @ X54 @ Z0 ) )
& ! [X55: reg] :
( ( c @ X55 @ X25 )
=> ( c @ X55 @ Z1 ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_14,plain,
( pp
= ( ^ [Z0: reg,Z1: reg] :
( ! [X64: reg] :
( ( c @ X64 @ Z0 )
=> ( c @ X64 @ Z1 ) )
& ~ ! [X65: reg] :
( ( c @ X65 @ Z1 )
=> ( c @ X65 @ Z0 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[pp]) ).
thf(c_0_15,plain,
( ntpp
= ( ^ [Z0: reg,Z1: reg] :
( ! [X74: reg] :
( ( c @ X74 @ Z0 )
=> ( c @ X74 @ Z1 ) )
& ~ ! [X75: reg] :
( ( c @ X75 @ Z1 )
=> ( c @ X75 @ Z0 ) )
& ~ ? [X25: reg] :
( ( c @ X25 @ Z0 )
& ~ ? [X76: reg] :
( ! [X77: reg] :
( ( c @ X77 @ X76 )
=> ( c @ X77 @ X25 ) )
& ! [X78: reg] :
( ( c @ X78 @ X76 )
=> ( c @ X78 @ Z0 ) ) )
& ( c @ X25 @ Z1 )
& ~ ? [X79: reg] :
( ! [X80: reg] :
( ( c @ X80 @ X79 )
=> ( c @ X80 @ X25 ) )
& ! [X81: reg] :
( ( c @ X81 @ X79 )
=> ( c @ X81 @ Z1 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[ntpp]) ).
thf(c_0_16,plain,
( ec
= ( ^ [Z0: reg,Z1: reg] :
( ( c @ Z0 @ Z1 )
& ~ ? [X61: reg] :
( ! [X62: reg] :
( ( c @ X62 @ X61 )
=> ( c @ X62 @ Z0 ) )
& ! [X63: reg] :
( ( c @ X63 @ X61 )
=> ( c @ X63 @ Z1 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_17,plain,
( pp
= ( ^ [Z0: reg,Z1: reg] :
( ! [X64: reg] :
( ( c @ X64 @ Z0 )
=> ( c @ X64 @ Z1 ) )
& ~ ! [X65: reg] :
( ( c @ X65 @ Z1 )
=> ( c @ X65 @ Z0 ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_14,c_0_11]) ).
thf(c_0_18,plain,
( eq
= ( ^ [Z0: reg,Z1: reg] :
( ! [X52: reg] :
( ( c @ X52 @ Z0 )
=> ( c @ X52 @ Z1 ) )
& ! [X53: reg] :
( ( c @ X53 @ Z1 )
=> ( c @ X53 @ Z0 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[eq]) ).
thf(c_0_19,plain,
( mbox
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
! [X14: $i] :
( ~ ( Z0 @ Z2 @ X14 )
| ( Z1 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox]) ).
thf(c_0_20,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_21,plain,
( ntpp
= ( ^ [Z0: reg,Z1: reg] :
( ! [X74: reg] :
( ( c @ X74 @ Z0 )
=> ( c @ X74 @ Z1 ) )
& ~ ! [X75: reg] :
( ( c @ X75 @ Z1 )
=> ( c @ X75 @ Z0 ) )
& ~ ? [X25: reg] :
( ( c @ X25 @ Z0 )
& ~ ? [X76: reg] :
( ! [X77: reg] :
( ( c @ X77 @ X76 )
=> ( c @ X77 @ X25 ) )
& ! [X78: reg] :
( ( c @ X78 @ X76 )
=> ( c @ X78 @ Z0 ) ) )
& ( c @ X25 @ Z1 )
& ~ ? [X79: reg] :
( ! [X80: reg] :
( ( c @ X80 @ X79 )
=> ( c @ X80 @ X25 ) )
& ! [X81: reg] :
( ( c @ X81 @ X79 )
=> ( c @ X81 @ Z1 ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
thf(c_0_22,negated_conjecture,
~ ( mvalid
@ ( mbox @ a
@ ^ [X44: $i] :
? [X25: reg,X45: reg] :
( ~ ( eq @ X25 @ X45 )
& ( p @ X25 @ france )
& ( p @ X45 @ france ) ) ) ),
inference(assume_negation,[status(cth)],[con]) ).
thf(c_0_23,plain,
( eq
= ( ^ [Z0: reg,Z1: reg] :
( ! [X52: reg] :
( ( c @ X52 @ Z0 )
=> ( c @ X52 @ Z1 ) )
& ! [X53: reg] :
( ( c @ X53 @ Z1 )
=> ( c @ X53 @ Z0 ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_18,c_0_11]) ).
thf(c_0_24,plain,
! [X120: $i,X119: $i] :
( ~ ( a @ X120 @ X119 )
| ( ! [X110: reg] :
( ( c @ X110 @ paris )
=> ( c @ X110 @ france ) )
& ~ ! [X111: reg] :
( ( c @ X111 @ france )
=> ( c @ X111 @ paris ) )
& ~ ? [X112: reg] :
( ( c @ X112 @ paris )
& ~ ? [X113: reg] :
( ! [X114: reg] :
( ( c @ X114 @ X113 )
=> ( c @ X114 @ X112 ) )
& ! [X115: reg] :
( ( c @ X115 @ X113 )
=> ( c @ X115 @ paris ) ) )
& ( c @ X112 @ france )
& ~ ? [X116: reg] :
( ! [X117: reg] :
( ( c @ X117 @ X116 )
=> ( c @ X117 @ X112 ) )
& ! [X118: reg] :
( ( c @ X118 @ X116 )
=> ( c @ X118 @ france ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[ax3]),c_0_19]),c_0_20]),c_0_21])]) ).
thf(c_0_25,negated_conjecture,
~ ! [X126: $i,X125: $i] :
( ~ ( a @ X126 @ X125 )
| ? [X25: reg,X45: reg] :
( ~ ( ! [X121: reg] :
( ( c @ X121 @ X25 )
=> ( c @ X121 @ X45 ) )
& ! [X122: reg] :
( ( c @ X122 @ X45 )
=> ( c @ X122 @ X25 ) ) )
& ! [X123: reg] :
( ( c @ X123 @ X25 )
=> ( c @ X123 @ france ) )
& ! [X124: reg] :
( ( c @ X124 @ X45 )
=> ( c @ X124 @ france ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_22]),c_0_19]),c_0_20]),c_0_11]),c_0_23])]) ).
thf(c_0_26,plain,
! [X158: $i,X159: $i,X160: reg,X162: reg,X164: reg,X165: reg,X167: reg,X168: reg] :
( ( ~ ( c @ X160 @ paris )
| ( c @ X160 @ france )
| ~ ( a @ X158 @ X159 ) )
& ( ( c @ esk12_0 @ france )
| ~ ( a @ X158 @ X159 ) )
& ( ~ ( c @ esk12_0 @ paris )
| ~ ( a @ X158 @ X159 ) )
& ( ~ ( c @ X167 @ ( esk14_1 @ X162 ) )
| ( c @ X167 @ X162 )
| ~ ( c @ X162 @ france )
| ~ ( c @ X164 @ ( esk13_1 @ X162 ) )
| ( c @ X164 @ X162 )
| ~ ( c @ X162 @ paris )
| ~ ( a @ X158 @ X159 ) )
& ( ~ ( c @ X168 @ ( esk14_1 @ X162 ) )
| ( c @ X168 @ france )
| ~ ( c @ X162 @ france )
| ~ ( c @ X164 @ ( esk13_1 @ X162 ) )
| ( c @ X164 @ X162 )
| ~ ( c @ X162 @ paris )
| ~ ( a @ X158 @ X159 ) )
& ( ~ ( c @ X167 @ ( esk14_1 @ X162 ) )
| ( c @ X167 @ X162 )
| ~ ( c @ X162 @ france )
| ~ ( c @ X165 @ ( esk13_1 @ X162 ) )
| ( c @ X165 @ paris )
| ~ ( c @ X162 @ paris )
| ~ ( a @ X158 @ X159 ) )
& ( ~ ( c @ X168 @ ( esk14_1 @ X162 ) )
| ( c @ X168 @ france )
| ~ ( c @ X162 @ france )
| ~ ( c @ X165 @ ( esk13_1 @ X162 ) )
| ( c @ X165 @ paris )
| ~ ( c @ X162 @ paris )
| ~ ( a @ X158 @ X159 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])])])])])]) ).
thf(c_0_27,negated_conjecture,
! [X171: reg,X172: reg,X173: reg,X174: reg] :
( ( a @ esk15_0 @ esk16_0 )
& ( ( c @ ( esk18_2 @ X171 @ X172 ) @ X172 )
| ( c @ ( esk17_2 @ X171 @ X172 ) @ X171 )
| ~ ( c @ X173 @ X171 )
| ( c @ X173 @ X172 ) )
& ( ~ ( c @ ( esk18_2 @ X171 @ X172 ) @ france )
| ( c @ ( esk17_2 @ X171 @ X172 ) @ X171 )
| ~ ( c @ X173 @ X171 )
| ( c @ X173 @ X172 ) )
& ( ( c @ ( esk18_2 @ X171 @ X172 ) @ X172 )
| ~ ( c @ ( esk17_2 @ X171 @ X172 ) @ france )
| ~ ( c @ X173 @ X171 )
| ( c @ X173 @ X172 ) )
& ( ~ ( c @ ( esk18_2 @ X171 @ X172 ) @ france )
| ~ ( c @ ( esk17_2 @ X171 @ X172 ) @ france )
| ~ ( c @ X173 @ X171 )
| ( c @ X173 @ X172 ) )
& ( ( c @ ( esk18_2 @ X171 @ X172 ) @ X172 )
| ( c @ ( esk17_2 @ X171 @ X172 ) @ X171 )
| ~ ( c @ X174 @ X172 )
| ( c @ X174 @ X171 ) )
& ( ~ ( c @ ( esk18_2 @ X171 @ X172 ) @ france )
| ( c @ ( esk17_2 @ X171 @ X172 ) @ X171 )
| ~ ( c @ X174 @ X172 )
| ( c @ X174 @ X171 ) )
& ( ( c @ ( esk18_2 @ X171 @ X172 ) @ X172 )
| ~ ( c @ ( esk17_2 @ X171 @ X172 ) @ france )
| ~ ( c @ X174 @ X172 )
| ( c @ X174 @ X171 ) )
& ( ~ ( c @ ( esk18_2 @ X171 @ X172 ) @ france )
| ~ ( c @ ( esk17_2 @ X171 @ X172 ) @ france )
| ~ ( c @ X174 @ X172 )
| ( c @ X174 @ X171 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])])])]) ).
thf(c_0_28,plain,
! [X3: $i,X14: $i] :
( ( c @ esk12_0 @ france )
| ~ ( a @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_29,negated_conjecture,
a @ esk15_0 @ esk16_0,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_30,negated_conjecture,
! [X20: reg,X19: reg,X18: reg] :
( ( c @ ( esk18_2 @ X18 @ X19 ) @ X19 )
| ( c @ ( esk17_2 @ X18 @ X19 ) @ X18 )
| ( c @ X20 @ X19 )
| ~ ( c @ X20 @ X18 ) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_31,negated_conjecture,
c @ esk12_0 @ france,
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
thf(c_0_32,negated_conjecture,
! [X20: reg,X19: reg,X18: reg] :
( ( c @ ( esk18_2 @ X18 @ X19 ) @ X19 )
| ( c @ X20 @ X19 )
| ~ ( c @ ( esk17_2 @ X18 @ X19 ) @ france )
| ~ ( c @ X20 @ X18 ) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_33,negated_conjecture,
! [X18: reg] :
( ( c @ ( esk17_2 @ france @ X18 ) @ france )
| ( c @ ( esk18_2 @ france @ X18 ) @ X18 )
| ( c @ esk12_0 @ X18 ) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
thf(c_0_34,plain,
! [X3: $i,X14: $i] :
( ~ ( c @ esk12_0 @ paris )
| ~ ( a @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_35,plain,
! [X18: reg,X3: $i,X14: $i] :
( ( c @ X18 @ france )
| ~ ( c @ X18 @ paris )
| ~ ( a @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_36,negated_conjecture,
! [X18: reg] :
( ( c @ ( esk18_2 @ france @ X18 ) @ X18 )
| ( c @ esk12_0 @ X18 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_31]),c_0_33]) ).
thf(c_0_37,negated_conjecture,
~ ( c @ esk12_0 @ paris ),
inference(spm,[status(thm)],[c_0_34,c_0_29]) ).
thf(c_0_38,negated_conjecture,
! [X3: $i,X14: $i] :
( ( c @ ( esk18_2 @ france @ paris ) @ france )
| ~ ( a @ X3 @ X14 ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
thf(c_0_39,negated_conjecture,
! [X20: reg,X19: reg,X18: reg] :
( ( c @ ( esk17_2 @ X18 @ X19 ) @ X18 )
| ( c @ X20 @ X19 )
| ~ ( c @ ( esk18_2 @ X18 @ X19 ) @ france )
| ~ ( c @ X20 @ X18 ) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_40,negated_conjecture,
c @ ( esk18_2 @ france @ paris ) @ france,
inference(spm,[status(thm)],[c_0_38,c_0_29]) ).
thf(c_0_41,negated_conjecture,
! [X18: reg] :
( ( c @ ( esk17_2 @ france @ paris ) @ france )
| ( c @ X18 @ paris )
| ~ ( c @ X18 @ france ) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
thf(c_0_42,negated_conjecture,
! [X20: reg,X19: reg,X18: reg] :
( ( c @ X20 @ X19 )
| ~ ( c @ ( esk18_2 @ X18 @ X19 ) @ france )
| ~ ( c @ ( esk17_2 @ X18 @ X19 ) @ france )
| ~ ( c @ X20 @ X18 ) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_43,negated_conjecture,
c @ ( esk17_2 @ france @ paris ) @ france,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_31]),c_0_37]) ).
thf(c_0_44,negated_conjecture,
! [X18: reg] :
( ( c @ X18 @ paris )
| ~ ( c @ X18 @ france ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_40]),c_0_43])]) ).
thf(c_0_45,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_44]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEG015^1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n019.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 18:34:33 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running higher-order theorem proving
% 0.08/0.25 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.Tks2WJxyIT/E---3.1_1189833.p
% 0.22/0.30 % Version: 3.5.1-ho
% 0.22/0.30 % Preprocessing class: HSMSSMSSMLLNHSN.
% 0.22/0.30 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.30 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.22/0.30 % Starting post_as_ho3 with 300s (1) cores
% 0.22/0.30 % Starting new_ho_12 with 300s (1) cores
% 0.22/0.30 % Starting new_bool_2 with 300s (1) cores
% 0.22/0.30 % new_ho_10_cnf2 with pid 1189846 completed with status 0
% 0.22/0.30 % Result found by new_ho_10_cnf2
% 0.22/0.30 % Preprocessing class: HSMSSMSSMLLNHSN.
% 0.22/0.30 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.30 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.22/0.30 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.30 % No SInE strategy applied
% 0.22/0.30 % Search class: HGHNF-FFMF21-SHSSMSBN
% 0.22/0.30 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.30 % Starting SubtermCWHack with 136s (1) cores
% 0.22/0.30 % Starting new_ho_10_cnf2 with 151s (1) cores
% 0.22/0.30 % Starting post_as_ho11 with 136s (1) cores
% 0.22/0.30 % Starting pre_casc_8 with 136s (1) cores
% 0.22/0.30 % Starting post_as_ho2 with 136s (1) cores
% 0.22/0.30 % SubtermCWHack with pid 1189851 completed with status 0
% 0.22/0.30 % Result found by SubtermCWHack
% 0.22/0.30 % Preprocessing class: HSMSSMSSMLLNHSN.
% 0.22/0.30 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.30 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.22/0.30 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.30 % No SInE strategy applied
% 0.22/0.30 % Search class: HGHNF-FFMF21-SHSSMSBN
% 0.22/0.30 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.30 % Starting SubtermCWHack with 136s (1) cores
% 0.22/0.30 % Preprocessing time : 0.001 s
% 0.22/0.30
% 0.22/0.30 % Proof found!
% 0.22/0.30 % SZS status Theorem
% 0.22/0.30 % SZS output start CNFRefutation
% See solution above
% 0.22/0.30 % Parsed axioms : 98
% 0.22/0.30 % Removed by relevancy pruning/SinE : 0
% 0.22/0.30 % Initial clauses : 91
% 0.22/0.30 % Removed in clause preprocessing : 49
% 0.22/0.30 % Initial clauses in saturation : 42
% 0.22/0.30 % Processed clauses : 248
% 0.22/0.30 % ...of these trivial : 13
% 0.22/0.30 % ...subsumed : 19
% 0.22/0.30 % ...remaining for further processing : 216
% 0.22/0.30 % Other redundant clauses eliminated : 0
% 0.22/0.30 % Clauses deleted for lack of memory : 0
% 0.22/0.30 % Backward-subsumed : 24
% 0.22/0.30 % Backward-rewritten : 23
% 0.22/0.30 % Generated clauses : 1226
% 0.22/0.30 % ...of the previous two non-redundant : 1112
% 0.22/0.30 % ...aggressively subsumed : 0
% 0.22/0.30 % Contextual simplify-reflections : 8
% 0.22/0.30 % Paramodulations : 1222
% 0.22/0.30 % Factorizations : 4
% 0.22/0.30 % NegExts : 0
% 0.22/0.30 % Equation resolutions : 0
% 0.22/0.30 % Disequality decompositions : 0
% 0.22/0.30 % Total rewrite steps : 148
% 0.22/0.30 % ...of those cached : 109
% 0.22/0.30 % Propositional unsat checks : 0
% 0.22/0.30 % Propositional check models : 0
% 0.22/0.30 % Propositional check unsatisfiable : 0
% 0.22/0.30 % Propositional clauses : 0
% 0.22/0.30 % Propositional clauses after purity: 0
% 0.22/0.30 % Propositional unsat core size : 0
% 0.22/0.30 % Propositional preprocessing time : 0.000
% 0.22/0.30 % Propositional encoding time : 0.000
% 0.22/0.30 % Propositional solver time : 0.000
% 0.22/0.30 % Success case prop preproc time : 0.000
% 0.22/0.30 % Success case prop encoding time : 0.000
% 0.22/0.30 % Success case prop solver time : 0.000
% 0.22/0.30 % Current number of processed clauses : 169
% 0.22/0.30 % Positive orientable unit clauses : 48
% 0.22/0.30 % Positive unorientable unit clauses: 0
% 0.22/0.30 % Negative unit clauses : 2
% 0.22/0.30 % Non-unit-clauses : 119
% 0.22/0.30 % Current number of unprocessed clauses: 884
% 0.22/0.30 % ...number of literals in the above : 4023
% 0.22/0.30 % Current number of archived formulas : 0
% 0.22/0.30 % Current number of archived clauses : 47
% 0.22/0.30 % Clause-clause subsumption calls (NU) : 7260
% 0.22/0.30 % Rec. Clause-clause subsumption calls : 4630
% 0.22/0.30 % Non-unit clause-clause subsumptions : 48
% 0.22/0.30 % Unit Clause-clause subsumption calls : 471
% 0.22/0.30 % Rewrite failures with RHS unbound : 0
% 0.22/0.30 % BW rewrite match attempts : 23
% 0.22/0.30 % BW rewrite match successes : 21
% 0.22/0.30 % Condensation attempts : 0
% 0.22/0.30 % Condensation successes : 0
% 0.22/0.30 % Termbank termtop insertions : 26656
% 0.22/0.30 % Search garbage collected termcells : 2014
% 0.22/0.30
% 0.22/0.30 % -------------------------------------------------
% 0.22/0.30 % User time : 0.023 s
% 0.22/0.30 % System time : 0.006 s
% 0.22/0.30 % Total time : 0.029 s
% 0.22/0.30 % Maximum resident set size: 3992 pages
% 0.22/0.30
% 0.22/0.30 % -------------------------------------------------
% 0.22/0.30 % User time : 0.050 s
% 0.22/0.30 % System time : 0.012 s
% 0.22/0.30 % Total time : 0.062 s
% 0.22/0.30 % Maximum resident set size: 4864 pages
% 0.22/0.30 % E exiting
%------------------------------------------------------------------------------