TSTP Solution File: SYO040^1 by Leo-III---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.12
% Problem : SYO040^1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n028.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 08:55:33 EDT 2024
% Result : Unsatisfiable 4.05s 2.04s
% Output : Refutation 4.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 4
% Syntax : Number of formulae : 32 ( 11 unt; 3 typ; 0 def)
% Number of atoms : 147 ( 14 equ; 0 cnn)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 125 ( 27 ~; 21 |; 0 &; 77 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 3 con; 0-2 aty)
% Number of variables : 0 ( 0 ^ 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(f_type,type,
f: $o > $o ).
thf(h_type,type,
h: $o > $i ).
thf(x_type,type,
x: $o ).
thf(1,axiom,
( ( h @ ( f @ ( f @ ( f @ x ) ) ) )
!= ( h @ ( f @ x ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',2) ).
thf(2,plain,
( ( h @ ( f @ ( f @ ( f @ x ) ) ) )
!= ( h @ ( f @ x ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(3,plain,
( ( h @ ( f @ ( f @ ( f @ x ) ) ) )
!= ( h @ ( f @ x ) ) ),
inference(polarity_switch,[status(thm)],[2]) ).
thf(4,plain,
( ( h @ ( f @ ( f @ ( f @ x ) ) ) )
!= ( h @ ( f @ x ) ) ),
inference(lifteq,[status(thm)],[3]) ).
thf(5,plain,
( ( f @ ( f @ ( f @ x ) ) )
!= ( f @ x ) ),
inference(simp,[status(thm)],[4]) ).
thf(6,plain,
( ( f @ ( f @ x ) )
!= x ),
inference(simp,[status(thm)],[5]) ).
thf(10,plain,
( ( f @ ( f @ x ) )
| x ),
inference(bool_ext,[status(thm)],[6]) ).
thf(7,plain,
( ~ ( f @ ( f @ ( f @ x ) ) )
| ~ ( f @ x ) ),
inference(bool_ext,[status(thm)],[5]) ).
thf(26,plain,
( x
| ~ ( f @ $true )
| ~ ( f @ x )
| ( ( f @ ( f @ x ) )
!= ( f @ ( f @ x ) ) ) ),
inference(paramod_ordered,[status(thm)],[10,7]) ).
thf(27,plain,
( x
| ~ ( f @ $true )
| ~ ( f @ x ) ),
inference(pattern_uni,[status(thm)],[26:[]]) ).
thf(54,plain,
( x
| ~ ( f @ x )
| ( ( f @ ( f @ x ) )
!= ( f @ $true ) ) ),
inference(paramod_ordered,[status(thm)],[10,27]) ).
thf(57,plain,
( x
| ~ ( f @ x )
| ~ ( f @ x ) ),
inference(simp,[status(thm)],[54]) ).
thf(61,plain,
( x
| ~ ( f @ x ) ),
inference(simp,[status(thm)],[57]) ).
thf(114,plain,
( x
| ( ( f @ ( f @ x ) )
!= ( f @ x ) ) ),
inference(paramod_ordered,[status(thm)],[10,61]) ).
thf(116,plain,
( x
| ( ( f @ x )
!= x ) ),
inference(simp,[status(thm)],[114]) ).
thf(119,plain,
( x
| ( f @ x )
| x ),
inference(bool_ext,[status(thm)],[116]) ).
thf(122,plain,
( x
| ( f @ x ) ),
inference(simp,[status(thm)],[119]) ).
thf(150,plain,
( x
| ( ( f @ x )
!= ( f @ x ) ) ),
inference(paramod_ordered,[status(thm)],[122,61]) ).
thf(151,plain,
x,
inference(pattern_uni,[status(thm)],[150:[]]) ).
thf(168,plain,
~ ( f @ ( f @ $true ) ),
inference(rewrite,[status(thm)],[6,151]) ).
thf(167,plain,
( ( f @ ( f @ ( f @ $true ) ) )
!= ( f @ $true ) ),
inference(rewrite,[status(thm)],[5,151]) ).
thf(180,plain,
( ( f @ $false )
!= ( f @ $true ) ),
inference(rewrite,[status(thm)],[167,168]) ).
thf(183,plain,
( ( f @ $false )
| ( f @ $true ) ),
inference(bool_ext,[status(thm)],[180]) ).
thf(200,plain,
( ( f @ $true )
| ( ( f @ ( f @ $true ) )
!= ( f @ $false ) ) ),
inference(paramod_ordered,[status(thm)],[183,168]) ).
thf(209,plain,
( ( f @ $true )
| ( f @ $true ) ),
inference(simp,[status(thm)],[200]) ).
thf(210,plain,
f @ $true,
inference(simp,[status(thm)],[209]) ).
thf(219,plain,
~ ( f @ $true ),
inference(rewrite,[status(thm)],[168,210]) ).
thf(224,plain,
~ $true,
inference(rewrite,[status(thm)],[219,210]) ).
thf(225,plain,
$false,
inference(simp,[status(thm)],[224]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO040^1 : TPTP v8.2.0. Released v4.0.0.
% 0.14/0.15 % Command : run_Leo-III %s %d
% 0.15/0.36 % Computer : n028.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon May 20 10:56:24 EDT 2024
% 0.22/0.36 % CPUTime :
% 0.96/0.91 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.12/1.02 % [INFO] Parsing done (107ms).
% 1.35/1.03 % [INFO] Running in sequential loop mode.
% 1.73/1.24 % [INFO] eprover registered as external prover.
% 1.73/1.25 % [INFO] cvc4 registered as external prover.
% 1.73/1.25 % [INFO] Scanning for conjecture ...
% 1.73/1.28 % [INFO] 1 axioms and no conjecture found.
% 1.73/1.29 % [INFO] Problem is higher-order (TPTP THF).
% 1.73/1.29 % [INFO] Type checking passed.
% 1.73/1.29 % [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.05/2.04 % [INFO] Killing All external provers ...
% 4.05/2.04 % Time passed: 1517ms (effective reasoning time: 1002ms)
% 4.05/2.04 % Axioms used in derivation (1): 2
% 4.05/2.04 % No. of inferences in proof: 29
% 4.05/2.04 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1517 ms resp. 1002 ms w/o parsing
% 4.05/2.06 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.05/2.06 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------