%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : CSR123^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 : n013.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:54 AM UTC 2026
% Result : Theorem 6.16s 2.80s
% Output : Refutation 6.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 4
% Syntax : Number of formulae : 31 ( 18 unt; 0 typ; 0 def)
% Number of atoms : 62 ( 12 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 214 ( 44 ~; 13 |; 8 &; 149 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 26 ( 26 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 40 ( 0 ^; 31 !; 9 ?; 40 :)
% Comments :
%------------------------------------------------------------------------------
thf(num_type,type,
num: $tType ).
thf(holdsDuring_THFTYPE_IiooI_decl,type,
holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
thf(lBen_THFTYPE_i_decl,type,
lBen_THFTYPE_i: $i ).
thf(lBill_THFTYPE_i_decl,type,
lBill_THFTYPE_i: $i ).
thf(lMary_THFTYPE_i_decl,type,
lMary_THFTYPE_i: $i ).
thf(lSue_THFTYPE_i_decl,type,
lSue_THFTYPE_i: $i ).
thf(lYearFn_THFTYPE_IiiI_decl,type,
lYearFn_THFTYPE_IiiI: $i > $i ).
thf(likes_THFTYPE_IiioI_decl,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(n2009_THFTYPE_i_decl,type,
n2009_THFTYPE_i: $i ).
thf(3,axiom,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax) ).
thf(8,plain,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(5,axiom,
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_002) ).
thf(10,plain,
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(4,axiom,
likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_001) ).
thf(9,plain,
likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(1,conjecture,
? [A: $i > $i > $o,B: $i,C: $i] :
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ( ( A @ lSue_THFTYPE_i @ B )
& ~ ( A @ lSue_THFTYPE_i @ C ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
thf(2,negated_conjecture,
~ ? [A: $i > $i > $o,B: $i,C: $i] :
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ( ( A @ lSue_THFTYPE_i @ B )
& ~ ( A @ lSue_THFTYPE_i @ C ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(6,plain,
~ ? [A: $i > $i > $o,B: $i,C: $i] :
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ( ( A @ lSue_THFTYPE_i @ B )
& ~ ( A @ lSue_THFTYPE_i @ C ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(7,plain,
! [C: $i,B: $i,A: $i > $i > $o] :
~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ( ( A @ lSue_THFTYPE_i @ B )
& ~ ( A @ lSue_THFTYPE_i @ C ) ) ),
inference(cnf,[status(esa)],[6]) ).
thf(24,plain,
! [C: $i,B: $i,A: $i > $i > $o] :
( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ( ( A @ lSue_THFTYPE_i @ B )
& ~ $true ) )
| ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
!= ( A @ lSue_THFTYPE_i @ C ) ) ),
inference(paramod_ordered,[status(thm)],[9,7]) ).
thf(25,plain,
! [B: $i,A: $i > $i > $o] :
( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
!= ( A @ lSue_THFTYPE_i @ B ) ) ),
inference(simp,[status(thm)],[24]) ).
thf(32,plain,
~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ),
inference(pre_uni,[status(thm)],[25:[bind(A,$thf( ^ [C: $i] : ^ [D: $i] : ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )),bind(B,$thf( B ))]]) ).
thf(63,plain,
( ~ $true
| ( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i ) )
!= ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(paramod_ordered,[status(thm)],[10,32]) ).
thf(64,plain,
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i ) )
!= ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ),
inference(simp,[status(thm)],[63]) ).
thf(65,plain,
( ( ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
!= ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) )
| ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i ) ),
inference(simp,[status(thm)],[64]) ).
thf(66,plain,
( ( ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
!= ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) )
| ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i ) ),
inference(cnf,[status(esa)],[65]) ).
thf(67,plain,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i ),
inference(simp,[status(thm)],[66]) ).
thf(68,plain,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $false,
inference(rewrite,[status(thm)],[10,67]) ).
thf(69,plain,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true,
inference(simp,[status(thm)],[68]) ).
thf(83,plain,
! [C: $i,B: $i,A: $i > $i > $o] :
( ~ $true
| ( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ( ( A @ lSue_THFTYPE_i @ B )
& ~ ( A @ lSue_THFTYPE_i @ C ) ) )
!= ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ) ),
inference(paramod_ordered,[status(thm)],[69,7]) ).
thf(84,plain,
! [C: $i,B: $i,A: $i > $i > $o] :
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ( ( A @ lSue_THFTYPE_i @ B )
& ~ ( A @ lSue_THFTYPE_i @ C ) ) )
!= ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
inference(simp,[status(thm)],[83]) ).
thf(92,plain,
! [C: $i,B: $i,A: $i > $i > $o] :
( ( ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
!= ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) )
| ~ ( ( A @ lSue_THFTYPE_i @ B )
& ~ ( A @ lSue_THFTYPE_i @ C ) ) ),
inference(simp,[status(thm)],[84]) ).
thf(96,plain,
! [C: $i,B: $i,A: $i > $i > $o] :
( ( ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
!= ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) )
| ~ ( A @ lSue_THFTYPE_i @ B )
| ( A @ lSue_THFTYPE_i @ C ) ),
inference(cnf,[status(esa)],[92]) ).
thf(97,plain,
! [C: $i,B: $i,A: $i > $i > $o] :
( ~ ( A @ lSue_THFTYPE_i @ B )
| ( A @ lSue_THFTYPE_i @ C ) ),
inference(simp,[status(thm)],[96]) ).
thf(146,plain,
! [C: $i,B: $i,A: $i > $i > $o] :
( ~ ( A @ lSue_THFTYPE_i @ B )
| ~ $true
| ( ( A @ lSue_THFTYPE_i @ C )
!= ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i ) ) ),
inference(paramod_ordered,[status(thm)],[97,67]) ).
thf(147,plain,
! [C: $i,B: $i,A: $i > $i > $o] :
( ~ ( A @ lSue_THFTYPE_i @ B )
| ( ( A @ lSue_THFTYPE_i @ C )
!= ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i ) ) ),
inference(simp,[status(thm)],[146]) ).
thf(194,plain,
! [A: $i] :
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ A ),
inference(pre_uni,[status(thm)],[147:[bind(A,$thf( ^ [D: $i] : ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i ) )),bind(B,$thf( B )),bind(C,$thf( lBen_THFTYPE_i ))]]) ).
thf(214,plain,
! [A: $i] :
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ A ),
inference(simp,[status(thm)],[194]) ).
thf(268,plain,
$false,
inference(rewrite,[status(thm)],[8,214]) ).
thf(269,plain,
$false,
inference(simp,[status(thm)],[268]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR123^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 : n013.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:54:21 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.90/0.79 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.24/0.99 % [INFO] Parsing done (190ms).
% 1.24/1.00 % [INFO] Running in sequential loop mode.
% 1.95/1.39 % [INFO] eprover registered as external prover.
% 2.14/1.40 % [INFO] Scanning for conjecture ...
% 2.32/1.50 % [INFO] Found a conjecture (or negated_conjecture) and 3 axioms. Running axiom selection ...
% 2.32/1.54 % [INFO] Axiom selection finished. Selected 3 axioms (removed 0 axioms).
% 2.32/1.54 % [INFO] Problem is higher-order (TPTP THF).
% 2.32/1.55 % [INFO] Type checking passed.
% 2.32/1.55 % [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 ...
% 5.71/2.80 % [INFO] Killing All external provers ...
% 6.16/2.80 % Time passed: 2451ms (effective reasoning time: 1793ms)
% 6.16/2.80 % 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)>
% 6.16/2.80 % Axioms used in derivation (3): ax, ax_002, ax_001
% 6.16/2.80 % No. of inferences in proof: 31
% 6.16/2.80 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2451 ms resp. 1793 ms w/o parsing
% 6.16/2.83 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.16/2.83 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------