TSTP Solution File: SYO500_8 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : SYO500_8 : TPTP v8.1.2. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n004.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 : Fri May 19 12:36:16 EDT 2023
% Result : Theorem 4.04s 1.95s
% Output : Refutation 4.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 3
% Syntax : Number of formulae : 33 ( 10 unt; 2 typ; 0 def)
% Number of atoms : 175 ( 18 equ; 0 cnn)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 140 ( 32 ~; 28 |; 0 &; 80 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 2 usr; 3 con; 0-2 aty)
% Number of variables : 0 ( 0 ^; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(f_type,type,
f: $o > $o ).
thf(x_type,type,
x: $o ).
thf(1,conjecture,
( ( f @ ( f @ ( f @ x ) ) )
= ( f @ x ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
thf(2,negated_conjecture,
( ( f @ ( f @ ( f @ x ) ) )
!= ( f @ x ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( f @ ( f @ ( f @ x ) ) )
!= ( f @ x ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( ( f @ ( f @ ( f @ x ) ) )
!= ( f @ x ) ),
inference(lifteq,[status(thm)],[3]) ).
thf(5,plain,
( ( f @ ( f @ x ) )
!= x ),
inference(simp,[status(thm)],[4]) ).
thf(9,plain,
( ( f @ ( f @ x ) )
| x ),
inference(bool_ext,[status(thm)],[5]) ).
thf(10,plain,
( x
| ~ ( f @ x )
| ( ( f @ ( f @ ( f @ x ) ) )
!= ( f @ ( f @ x ) ) ) ),
inference(paramod_ordered,[status(thm)],[9,4]) ).
thf(21,plain,
( x
| ~ ( f @ x )
| ( ( f @ ( f @ x ) )
!= ( f @ x ) ) ),
inference(simp,[status(thm)],[10]) ).
thf(96,plain,
( x
| ( ( f @ ( f @ x ) )
!= ( f @ x ) )
| ( ( f @ ( f @ x ) )
!= ( f @ x ) ) ),
inference(paramod_ordered,[status(thm)],[9,21]) ).
thf(105,plain,
( x
| ( ( f @ x )
!= x )
| ( ( f @ x )
!= x ) ),
inference(simp,[status(thm)],[96]) ).
thf(112,plain,
( x
| ( ( f @ x )
!= x ) ),
inference(simp,[status(thm)],[105]) ).
thf(119,plain,
( x
| ( f @ x )
| x ),
inference(bool_ext,[status(thm)],[112]) ).
thf(122,plain,
( x
| ( f @ x ) ),
inference(simp,[status(thm)],[119]) ).
thf(6,plain,
( ~ ( f @ ( f @ ( f @ x ) ) )
| ~ ( f @ x ) ),
inference(bool_ext,[status(thm)],[4]) ).
thf(28,plain,
( x
| ~ ( f @ $true )
| ~ ( f @ x )
| ( ( f @ ( f @ x ) )
!= ( f @ ( f @ x ) ) ) ),
inference(paramod_ordered,[status(thm)],[9,6]) ).
thf(29,plain,
( x
| ~ ( f @ $true )
| ~ ( f @ x ) ),
inference(pattern_uni,[status(thm)],[28:[]]) ).
thf(82,plain,
( x
| ~ ( f @ x )
| ( ( f @ ( f @ x ) )
!= ( f @ $true ) ) ),
inference(paramod_ordered,[status(thm)],[9,29]) ).
thf(90,plain,
( x
| ~ ( f @ x )
| ~ ( f @ x ) ),
inference(simp,[status(thm)],[82]) ).
thf(92,plain,
( x
| ~ ( f @ x ) ),
inference(simp,[status(thm)],[90]) ).
thf(132,plain,
( x
| ( ( f @ x )
!= ( f @ x ) ) ),
inference(paramod_ordered,[status(thm)],[122,92]) ).
thf(133,plain,
x,
inference(pattern_uni,[status(thm)],[132:[]]) ).
thf(157,plain,
~ ( f @ ( f @ $true ) ),
inference(rewrite,[status(thm)],[5,133]) ).
thf(162,plain,
( ( f @ ( f @ ( f @ $true ) ) )
!= ( f @ $true ) ),
inference(rewrite,[status(thm)],[4,133]) ).
thf(167,plain,
( ( f @ $false )
!= ( f @ $true ) ),
inference(rewrite,[status(thm)],[162,157]) ).
thf(170,plain,
( ( f @ $false )
| ( f @ $true ) ),
inference(bool_ext,[status(thm)],[167]) ).
thf(176,plain,
( ( f @ $true )
| ( ( f @ ( f @ $true ) )
!= ( f @ $false ) ) ),
inference(paramod_ordered,[status(thm)],[170,157]) ).
thf(185,plain,
( ( f @ $true )
| ( f @ $true ) ),
inference(simp,[status(thm)],[176]) ).
thf(188,plain,
f @ $true,
inference(simp,[status(thm)],[185]) ).
thf(192,plain,
~ ( f @ $true ),
inference(rewrite,[status(thm)],[157,188]) ).
thf(198,plain,
~ $true,
inference(rewrite,[status(thm)],[192,188]) ).
thf(199,plain,
$false,
inference(simp,[status(thm)],[198]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO500_8 : TPTP v8.1.2. Released v8.0.0.
% 0.13/0.15 % Command : run_Leo-III %s %d
% 0.15/0.36 % Computer : n004.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 : Thu May 18 18:41:10 EDT 2023
% 0.22/0.36 % CPUTime :
% 0.98/0.88 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.20/0.99 % [INFO] Parsing done (111ms).
% 1.20/1.00 % [INFO] Running in sequential loop mode.
% 1.61/1.21 % [INFO] eprover registered as external prover.
% 1.61/1.21 % [INFO] cvc4 registered as external prover.
% 1.61/1.21 % [INFO] Scanning for conjecture ...
% 1.78/1.26 % [INFO] Found a conjecture and 0 axioms. Running axiom selection ...
% 1.78/1.27 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.78/1.27 % [INFO] Problem is typed first-order (TPTP TFF).
% 1.78/1.28 % [INFO] Type checking passed.
% 1.78/1.28 % [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.04/1.95 % [INFO] Killing All external provers ...
% 4.04/1.95 % Time passed: 1434ms (effective reasoning time: 947ms)
% 4.04/1.95 % 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.04/1.95 % Axioms used in derivation (0):
% 4.04/1.95 % No. of inferences in proof: 31
% 4.04/1.95 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1434 ms resp. 947 ms w/o parsing
% 4.04/1.97 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.04/1.97 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------