TSTP Solution File: SYO026^1 by Leo-III---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.12
% Problem : SYO026^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n026.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:28 EDT 2024
% Result : Theorem 4.31s 2.47s
% Output : Refutation 4.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 7
% Syntax : Number of formulae : 52 ( 18 unt; 6 typ; 0 def)
% Number of atoms : 154 ( 20 equ; 6 cnn)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 121 ( 44 ~; 19 |; 9 &; 46 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 6 usr; 7 con; 0-2 aty)
% Number of variables : 21 ( 18 ^ 3 !; 0 ?; 21 :)
% Comments :
%------------------------------------------------------------------------------
thf(p_type,type,
p: ( $o > $o ) > $o ).
thf(sk1_type,type,
sk1: $o > $o ).
thf(sk2_type,type,
sk2: $o ).
thf(sk3_type,type,
sk3: $o ).
thf(sk4_type,type,
sk4: $o ).
thf(sk5_type,type,
sk5: $o ).
thf(1,conjecture,
( ( ( p
@ ^ [A: $o] : A )
& ( p @ (~) )
& ( p
@ ^ [A: $o] : $false )
& ( p
@ ^ [A: $o] : $true ) )
=> ! [A: $o > $o] : ( p @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(2,negated_conjecture,
~ ( ( ( p
@ ^ [A: $o] : A )
& ( p @ (~) )
& ( p
@ ^ [A: $o] : $false )
& ( p
@ ^ [A: $o] : $true ) )
=> ! [A: $o > $o] : ( p @ A ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ( ( p
@ ^ [A: $o] : A )
& ( p @ (~) )
& ( p
@ ^ [A: $o] : $false )
& ( p
@ ^ [A: $o] : $true ) )
=> ! [A: $o > $o] : ( p @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(6,plain,
( p
@ ^ [A: $o] : A ),
inference(cnf,[status(esa)],[3]) ).
thf(8,plain,
~ ( p @ sk1 ),
inference(cnf,[status(esa)],[3]) ).
thf(10,plain,
( ( p @ sk1 )
!= ( p
@ ^ [A: $o] : A ) ),
inference(paramod_ordered,[status(thm)],[6,8]) ).
thf(14,plain,
( sk1
!= ( ^ [A: $o] : A ) ),
inference(simp,[status(thm)],[10]) ).
thf(17,plain,
( ( sk1 @ sk2 )
!= sk2 ),
inference(func_ext,[status(esa)],[14]) ).
thf(22,plain,
( ( sk1 @ sk2 )
| sk2 ),
inference(bool_ext,[status(thm)],[17]) ).
thf(5,plain,
( p
@ ^ [A: $o] : $false ),
inference(cnf,[status(esa)],[3]) ).
thf(9,plain,
( ( p @ sk1 )
!= ( p
@ ^ [A: $o] : $false ) ),
inference(paramod_ordered,[status(thm)],[5,8]) ).
thf(13,plain,
( sk1
!= ( ^ [A: $o] : $false ) ),
inference(simp,[status(thm)],[9]) ).
thf(18,plain,
sk1 @ sk3,
inference(func_ext,[status(esa)],[13]) ).
thf(23,plain,
( ~ sk2
| ( ( sk1 @ sk3 )
!= ( sk1 @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[18,17]) ).
thf(24,plain,
( ~ sk2
| ( sk3 != sk2 ) ),
inference(simp,[status(thm)],[23]) ).
thf(7,plain,
p @ (~),
inference(cnf,[status(esa)],[3]) ).
thf(11,plain,
( ( p @ sk1 )
!= ( p @ (~) ) ),
inference(paramod_ordered,[status(thm)],[7,8]) ).
thf(15,plain,
sk1 != (~),
inference(simp,[status(thm)],[11]) ).
thf(19,plain,
( ( sk1 @ sk4 )
!= ~ sk4 ),
inference(func_ext,[status(esa)],[15]) ).
thf(31,plain,
( sk4
| ( ( sk1 @ sk4 )
!= ( sk1 @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[18,19]) ).
thf(32,plain,
( sk4
| ( sk4 != sk3 ) ),
inference(simp,[status(thm)],[31]) ).
thf(55,plain,
( sk4
| sk4
| sk3 ),
inference(bool_ext,[status(thm)],[32]) ).
thf(56,plain,
( sk4
| sk3 ),
inference(simp,[status(thm)],[55]) ).
thf(4,plain,
( p
@ ^ [A: $o] : $true ),
inference(cnf,[status(esa)],[3]) ).
thf(12,plain,
( ( p @ sk1 )
!= ( p
@ ^ [A: $o] : $true ) ),
inference(paramod_ordered,[status(thm)],[4,8]) ).
thf(16,plain,
( sk1
!= ( ^ [A: $o] : $true ) ),
inference(simp,[status(thm)],[12]) ).
thf(20,plain,
~ ( sk1 @ sk5 ),
inference(func_ext,[status(esa)],[16]) ).
thf(25,plain,
( ( sk1 @ sk5 )
!= ( sk1 @ sk3 ) ),
inference(paramod_ordered,[status(thm)],[18,20]) ).
thf(26,plain,
sk5 != sk3,
inference(simp,[status(thm)],[25]) ).
thf(28,plain,
( sk5
| sk3 ),
inference(bool_ext,[status(thm)],[26]) ).
thf(30,plain,
( ( sk1 @ sk4 )
| ~ sk4 ),
inference(bool_ext,[status(thm)],[19]) ).
thf(34,plain,
( ~ sk4
| ( sk1 @ sk4 ) ),
inference(cnf,[status(esa)],[30]) ).
thf(71,plain,
( ~ sk4
| ( ( sk1 @ sk5 )
!= ( sk1 @ sk4 ) ) ),
inference(paramod_ordered,[status(thm)],[34,20]) ).
thf(80,plain,
( ~ sk4
| ( sk5 != sk4 ) ),
inference(simp,[status(thm)],[71]) ).
thf(85,plain,
( sk3
| ~ sk4
| ( sk5 != sk5 ) ),
inference(paramod_ordered,[status(thm)],[28,80]) ).
thf(86,plain,
( sk3
| ~ sk4 ),
inference(pattern_uni,[status(thm)],[85:[]]) ).
thf(100,plain,
( sk3
| ( sk4 != sk4 ) ),
inference(paramod_ordered,[status(thm)],[56,86]) ).
thf(101,plain,
sk3,
inference(pattern_uni,[status(thm)],[100:[]]) ).
thf(102,plain,
( ~ sk2
| ~ sk2 ),
inference(rewrite,[status(thm)],[24,101]) ).
thf(103,plain,
~ sk2,
inference(simp,[status(thm)],[102]) ).
thf(112,plain,
( ( sk1 @ $false )
| $false ),
inference(rewrite,[status(thm)],[22,103]) ).
thf(113,plain,
sk1 @ $false,
inference(simp,[status(thm)],[112]) ).
thf(107,plain,
~ sk5,
inference(rewrite,[status(thm)],[26,101]) ).
thf(116,plain,
~ ( sk1 @ $false ),
inference(rewrite,[status(thm)],[20,107]) ).
thf(128,plain,
$false,
inference(rewrite,[status(thm)],[113,116]) ).
thf(129,plain,
$false,
inference(simp,[status(thm)],[128]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SYO026^1 : TPTP v8.2.0. Released v3.7.0.
% 0.00/0.11 % Command : run_Leo-III %s %d
% 0.10/0.31 % Computer : n026.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon May 20 10:34:24 EDT 2024
% 0.16/0.31 % CPUTime :
% 0.99/0.93 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.29/1.09 % [INFO] Parsing done (152ms).
% 1.29/1.10 % [INFO] Running in sequential loop mode.
% 1.69/1.45 % [INFO] eprover registered as external prover.
% 1.69/1.46 % [INFO] cvc4 registered as external prover.
% 1.69/1.46 % [INFO] Scanning for conjecture ...
% 1.97/1.54 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.97/1.57 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.97/1.57 % [INFO] Problem is higher-order (TPTP THF).
% 1.97/1.58 % [INFO] Type checking passed.
% 1.97/1.58 % [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.31/2.46 % [INFO] Killing All external provers ...
% 4.31/2.47 % Time passed: 2011ms (effective reasoning time: 1363ms)
% 4.31/2.47 % 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.31/2.47 % Axioms used in derivation (0):
% 4.31/2.47 % No. of inferences in proof: 46
% 4.31/2.47 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2011 ms resp. 1363 ms w/o parsing
% 4.31/2.51 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.31/2.51 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------