%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : PUZ137_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% Computer : n005.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 : Sun Sep 27 08:21:26 AM UTC 2026
% Result : Theorem 4.09s 2.69s
% Output : Refutation 4.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 5
% Syntax : Number of formulae : 40 ( 13 unt; 0 typ; 3 def)
% Number of atoms : 123 ( 22 equ; 0 cnn)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 190 ( 63 ~; 28 |; 2 &; 84 @)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 6 con; 0-2 aty)
% Number of variables : 18 ( 0 ^; 15 !; 0 ?; 18 :)
% ( 0 !>; 0 ?*; 0 @-; 3 @+)
% Comments :
%------------------------------------------------------------------------------
thf(peter_decl,type,
peter: $i ).
thf(says_decl,type,
says: $i > $o > $o ).
thf(sk1_decl,type,
sk1: $o ).
thf(sk2_decl,type,
sk2: $o ).
thf(sk6_decl,type,
sk6: $o ).
thf(sk1_def,definition,
( sk1
= ( @+[A: $o] :
~ ( A @ ( peter @ says ) ) ) ) ).
thf(sk2_def,definition,
( sk2
= ( @+[A: $o] :
~ ( ( A @ ( peter @ says ) )
=> ~ A ) ) ) ).
thf(sk6_def,definition,
( sk6
= ( @+[A: $o] :
~ ( ( A @ ( peter @ says ) )
=> ~ A ) ) ) ).
thf(3,axiom,
( ! [A: $o] :
( ( A @ ( peter @ says ) )
=> ~ A )
@ ( peter @ says ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).
thf(6,plain,
( ! [A: $o] :
( ( A @ ( peter @ says ) )
=> ~ A )
@ ( peter @ says ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(1,conjecture,
! [A: $o] : ( A @ ( peter @ says ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).
thf(2,negated_conjecture,
~ ! [A: $o] : ( A @ ( peter @ says ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(4,plain,
~ ! [A: $o] : ( A @ ( peter @ says ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(5,plain,
~ ( sk1 @ ( peter @ says ) ),
inference(cnf,[status(esa)],[4]) ).
thf(7,plain,
( ( ( ! [A: $o] :
( ( A @ ( peter @ says ) )
=> ~ A )
@ ( peter @ says ) )
!= ( sk1 @ ( peter @ says ) ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[6,5]) ).
thf(8,plain,
( ( ! [A: $o] :
( ( A @ ( peter @ says ) )
=> ~ A )
@ ( peter @ says ) )
!= ( sk1 @ ( peter @ says ) ) ),
inference(simp,[status(thm)],[7]) ).
thf(9,plain,
( ( ( ! [A: $o] :
( ( A @ ( peter @ says ) )
=> ~ A ) )
!= sk1 )
| ( peter != peter ) ),
inference(simp,[status(thm)],[8]) ).
thf(10,plain,
( ( ! [A: $o] :
( ( A @ ( peter @ says ) )
=> ~ A ) )
!= sk1 ),
inference(simp,[status(thm)],[9]) ).
thf(12,plain,
( sk1
| ! [A: $o] :
( ( A @ ( peter @ says ) )
=> ~ A ) ),
inference(bool_ext,[status(thm)],[10]) ).
thf(16,plain,
! [A: $o] :
( sk1
| ~ A
| ~ ( A @ ( peter @ says ) ) ),
inference(cnf,[status(esa)],[12]) ).
thf(17,plain,
( ~ ( $true @ ( peter @ says ) )
| sk1 ),
inference(simp,[status(thm)],[16]) ).
thf(11,plain,
( ~ sk1
| ~ ! [A: $o] :
( ( A @ ( peter @ says ) )
=> ~ A ) ),
inference(bool_ext,[status(thm)],[10]) ).
thf(13,plain,
( ( ~ sk1
| sk2 )
& ( ~ sk1
| ( sk2 @ ( peter @ says ) ) ) ),
inference(cnf,[status(esa)],[11]) ).
thf(15,plain,
( ~ sk1
| sk2 ),
inference(cnfConj,[status(thm)],[13]) ).
thf(14,plain,
( ~ sk1
| ( sk2 @ ( peter @ says ) ) ),
inference(cnfConj,[status(thm)],[13]) ).
thf(68,plain,
( ( ( sk2 @ ( peter @ says ) )
!= ( sk1 @ ( peter @ says ) ) )
| ~ $true
| ~ sk1 ),
inference(paramod_ordered,[status(thm)],[14,5]) ).
thf(69,plain,
( ( ( sk2 @ ( peter @ says ) )
!= ( sk1 @ ( peter @ says ) ) )
| ~ sk1 ),
inference(simp,[status(thm)],[68]) ).
thf(78,plain,
( ( sk2 != sk1 )
| ( peter != peter )
| ~ sk1 ),
inference(simp,[status(thm)],[69]) ).
thf(79,plain,
( ( sk2 != sk1 )
| ~ sk1 ),
inference(simp,[status(thm)],[78]) ).
thf(92,plain,
( ( sk2 != sk2 )
| ~ sk1
| ~ sk1
| ~ sk1 ),
inference(paramod_ordered,[status(thm)],[15,79]) ).
thf(93,plain,
( ( sk2 != sk2 )
| ~ sk1 ),
inference(simp,[status(thm)],[92]) ).
thf(94,plain,
~ sk1,
inference(pattern_uni,[status(thm)],[93:[]]) ).
thf(100,plain,
( ~ ( $true @ ( peter @ says ) )
| $false ),
inference(rewrite,[status(thm)],[17,94]) ).
thf(101,plain,
~ ( $true @ ( peter @ says ) ),
inference(simp,[status(thm)],[100]) ).
thf(117,plain,
( ( ( ! [A: $o] :
( ( A @ ( peter @ says ) )
=> ~ A )
@ ( peter @ says ) )
!= ( $true @ ( peter @ says ) ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[6,101]) ).
thf(118,plain,
( ( ! [A: $o] :
( ( A @ ( peter @ says ) )
=> ~ A )
@ ( peter @ says ) )
!= ( $true @ ( peter @ says ) ) ),
inference(simp,[status(thm)],[117]) ).
thf(119,plain,
( ~ ! [A: $o] :
( ( A @ ( peter @ says ) )
=> ~ A )
| ( peter != peter ) ),
inference(simp,[status(thm)],[118]) ).
thf(120,plain,
( ( sk6
| ( peter != peter ) )
& ( ( sk6 @ ( peter @ says ) )
| ( peter != peter ) ) ),
inference(cnf,[status(esa)],[119]) ).
thf(121,plain,
( ( sk6 @ ( peter @ says ) )
| ( peter != peter ) ),
inference(cnfConj,[status(thm)],[120]) ).
thf(123,plain,
sk6 @ ( peter @ says ),
inference(simp,[status(thm)],[121]) ).
thf(122,plain,
( sk6
| ( peter != peter ) ),
inference(cnfConj,[status(thm)],[120]) ).
thf(124,plain,
sk6,
inference(simp,[status(thm)],[122]) ).
thf(127,plain,
$true @ ( peter @ says ),
inference(rewrite,[status(thm)],[123,124]) ).
thf(128,plain,
~ $true,
inference(rewrite,[status(thm)],[101,127]) ).
thf(129,plain,
$false,
inference(simp,[status(thm)],[128]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PUZ137_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.07 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.14/0.40 % Computer : n005.cluster.edu
% 0.14/0.40 % Model : x86_64 x86_64
% 0.14/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40 % Memory : 8046.5625MB
% 0.14/0.40 % OS : Linux 6.8.0-71-generic
% 0.14/0.40 % CPULimit : 300
% 0.14/0.40 % WCLimit : 300
% 0.14/0.40 % DateTime : Sat Sep 26 05:19:32 UTC 2026
% 0.14/0.40 % CPUTime :
% 0.14/0.40 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.88/0.98 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.29/1.15 % [INFO] Parsing done (170ms).
% 1.29/1.17 % [INFO] Running in sequential loop mode.
% 1.83/1.57 % [INFO] eprover registered as external prover.
% 1.83/1.58 % [INFO] Scanning for conjecture ...
% 2.06/1.68 % [INFO] Found a conjecture (or negated_conjecture) and 1 axioms. Running axiom selection ...
% 2.23/1.71 % [INFO] Axiom selection finished. Selected 1 axioms (removed 0 axioms).
% 2.23/1.72 % [INFO] Problem is typed first-order (TPTP TFF).
% 2.23/1.73 % [INFO] Type checking passed.
% 2.23/1.73 % [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 ...
% 4.09/2.68 % [INFO] Killing All external provers ...
% 4.09/2.69 % Time passed: 2138ms (effective reasoning time: 1514ms)
% 4.09/2.69 % 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)>
% 4.09/2.69 % Axioms used in derivation (1): ax1
% 4.09/2.69 % No. of inferences in proof: 37
% 4.09/2.69 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2138 ms resp. 1514 ms w/o parsing
% 4.39/2.75 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.39/2.75 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------