%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : CSR136^1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% Computer : n014.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:46:57 AM UTC 2026
% Result : Theorem 7.69s 2.23s
% Output : Refutation 7.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of formulae : 30 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 40 ( 12 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 233 ( 44 ~; 33 |; 6 &; 150 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 32 ( 32 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 6 con; 0-2 aty)
% Number of variables : 51 ( 0 ^; 48 !; 3 ?; 51 :)
% Comments :
%------------------------------------------------------------------------------
thf(num_type,type,
num: $tType ).
thf(lBill_THFTYPE_i_decl,type,
lBill_THFTYPE_i: $i ).
thf(lBob_THFTYPE_i_decl,type,
lBob_THFTYPE_i: $i ).
thf(lMary_THFTYPE_i_decl,type,
lMary_THFTYPE_i: $i ).
thf(lSue_THFTYPE_i_decl,type,
lSue_THFTYPE_i: $i ).
thf(likes_THFTYPE_IiioI_decl,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(1,conjecture,
? [A: $i > $i > $o] :
( ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ~ ! [B: $i,C: $i] : ( A @ B @ C ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
thf(2,negated_conjecture,
~ ? [A: $i > $i > $o] :
( ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ~ ! [B: $i,C: $i] : ( A @ B @ C ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(11,plain,
~ ? [A: $i > $i > $o] :
( ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ~ ! [B: $i,C: $i] : ( A @ B @ C ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(12,plain,
! [C: $i,B: $i,A: $i > $i > $o] :
( ~ ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( A @ B @ C ) ),
inference(cnf,[status(esa)],[11]) ).
thf(4,axiom,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_001) ).
thf(14,plain,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(15,plain,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
inference(polarity_switch,[status(thm)],[14]) ).
thf(41,plain,
! [C: $i,B: $i,A: $i > $i > $o] :
( ~ ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ~ $true
| ( ( A @ B @ C )
!= ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) ) ),
inference(paramod_ordered,[status(thm)],[12,15]) ).
thf(42,plain,
! [C: $i,B: $i,A: $i > $i > $o] :
( ~ ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( ( A @ B @ C )
!= ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) ) ),
inference(simp,[status(thm)],[41]) ).
thf(57,plain,
( ~ ( likes_THFTYPE_IiioI @ lBill_THFTYPE_i @ lMary_THFTYPE_i )
| ~ ( likes_THFTYPE_IiioI @ lBill_THFTYPE_i @ lMary_THFTYPE_i ) ),
inference(pre_uni,[status(thm)],[42:[bind(A,$thf( ^ [D: $i] : ^ [E: $i] : ( likes_THFTYPE_IiioI @ E @ lMary_THFTYPE_i ) )),bind(B,$thf( B )),bind(C,$thf( lSue_THFTYPE_i ))]]) ).
thf(103,plain,
~ ( likes_THFTYPE_IiioI @ lBill_THFTYPE_i @ lMary_THFTYPE_i ),
inference(simp,[status(thm)],[57]) ).
thf(8,axiom,
likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_005) ).
thf(19,plain,
likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(47,plain,
! [C: $i > $i > $o,B: $i,A: $i] :
( ~ ~ ( C @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ~ ( C @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( C @ A @ B ) ),
inference(prim_subst,[status(thm)],[12:[bind(A,$thf( ^ [E: $i] : ^ [F: $i] : ~ ( D @ E @ F ) ))]]) ).
thf(87,plain,
! [C: $i > $i > $o,B: $i,A: $i] :
( ( C @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( C @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( C @ A @ B ) ),
inference(cnf,[status(esa)],[47]) ).
thf(88,plain,
! [C: $i > $i > $o,B: $i,A: $i] :
( ( C @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( C @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( C @ A @ B ) ),
inference(simp,[status(thm)],[87]) ).
thf(192,plain,
! [C: $i > $i > $o,B: $i,A: $i] :
( ( C @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( C @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ~ $true
| ( ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
!= ( C @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[19,88]) ).
thf(193,plain,
! [C: $i > $i > $o,B: $i,A: $i] :
( ( C @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( C @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
!= ( C @ A @ B ) ) ),
inference(simp,[status(thm)],[192]) ).
thf(222,plain,
( ( likes_THFTYPE_IiioI @ lBill_THFTYPE_i @ lBill_THFTYPE_i )
| ( likes_THFTYPE_IiioI @ lBill_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(pre_uni,[status(thm)],[193:[bind(A,$thf( A )),bind(B,$thf( lBob_THFTYPE_i )),bind(C,$thf( ^ [D: $i] : ^ [E: $i] : ( likes_THFTYPE_IiioI @ E @ lBill_THFTYPE_i ) ))]]) ).
thf(266,plain,
likes_THFTYPE_IiioI @ lBill_THFTYPE_i @ lBill_THFTYPE_i,
inference(simp,[status(thm)],[222]) ).
thf(43,plain,
! [C: $i,B: $i,A: $i > $i > $o] :
( ~ ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( A @ B @ C )
| ( ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[12]) ).
thf(63,plain,
! [C: $i,B: $i,A: $i > $i > $o] :
( ~ ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( A @ B @ C )
| ( ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
inference(pre_uni,[status(thm)],[43:[]]) ).
thf(64,plain,
! [C: $i,B: $i,A: $i > $i > $o] :
( ( A @ B @ C )
| ~ ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
inference(pre_uni,[status(thm)],[63:[]]) ).
thf(846,plain,
! [C: $i,B: $i,A: $i > $i > $o] :
( ( A @ B @ C )
| ~ $true
| ( ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
| ( ( likes_THFTYPE_IiioI @ lBill_THFTYPE_i @ lBill_THFTYPE_i )
!= ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
inference(paramod_ordered,[status(thm)],[266,64]) ).
thf(847,plain,
! [C: $i,B: $i,A: $i > $i > $o] :
( ( A @ B @ C )
| ( ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
| ( ( likes_THFTYPE_IiioI @ lBill_THFTYPE_i @ lBill_THFTYPE_i )
!= ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
inference(simp,[status(thm)],[846]) ).
thf(937,plain,
! [A: $i] :
( ( likes_THFTYPE_IiioI @ lBill_THFTYPE_i @ A )
| ( ( likes_THFTYPE_IiioI @ lBill_THFTYPE_i @ lBill_THFTYPE_i )
!= ( likes_THFTYPE_IiioI @ lBill_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
inference(pre_uni,[status(thm)],[847:[bind(A,$thf( ^ [D: $i] : ( likes_THFTYPE_IiioI @ lBill_THFTYPE_i ) )),bind(B,$thf( B )),bind(C,$thf( C ))]]) ).
thf(941,plain,
! [A: $i] : ( likes_THFTYPE_IiioI @ lBill_THFTYPE_i @ A ),
inference(pattern_uni,[status(thm)],[937:[]]) ).
thf(982,plain,
! [A: $i] : ( likes_THFTYPE_IiioI @ lBill_THFTYPE_i @ A ),
inference(simp,[status(thm)],[941]) ).
thf(1146,plain,
~ $true,
inference(rewrite,[status(thm)],[103,982]) ).
thf(1147,plain,
$false,
inference(simp,[status(thm)],[1146]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR136^1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.08 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.12/0.20 % Computer : n014.cluster.edu
% 0.12/0.20 % Model : x86_64 x86_64
% 0.12/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.20 % Memory : 8046.5625MB
% 0.12/0.20 % OS : Linux 6.8.0-71-generic
% 0.12/0.20 % CPULimit : 300
% 0.12/0.20 % WCLimit : 300
% 0.12/0.20 % DateTime : Tue Sep 29 17:55:45 UTC 2026
% 0.12/0.20 % CPUTime :
% 0.12/0.20 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.66/0.52 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.87/0.63 % [INFO] Parsing done (103ms).
% 1.05/0.63 % [INFO] Running in sequential loop mode.
% 1.43/0.82 % [INFO] eprover registered as external prover.
% 1.43/0.82 % [INFO] Scanning for conjecture ...
% 1.43/0.87 % [INFO] Found a conjecture (or negated_conjecture) and 8 axioms. Running axiom selection ...
% 1.43/0.88 % [INFO] Axiom selection finished. Selected 8 axioms (removed 0 axioms).
% 1.43/0.89 % [INFO] Problem is higher-order (TPTP THF).
% 1.43/0.89 % [INFO] Type checking passed.
% 1.43/0.89 % [CONFIG] Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>. Searching for refutation ...
% 7.69/2.23 % [INFO] Killing All external provers ...
% 7.69/2.23 % Time passed: 1924ms (effective reasoning time: 1591ms)
% 7.69/2.23 % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 7.69/2.23 % Axioms used in derivation (2): ax_001, ax_005
% 7.69/2.23 % No. of inferences in proof: 30
% 7.69/2.23 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1924 ms resp. 1591 ms w/o parsing
% 7.69/2.25 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.69/2.25 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------