TSTP Solution File: SYN415+1 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SYN415+1 : TPTP v8.2.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n022.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:18:27 EDT 2024
% Result : Theorem 4.36s 1.96s
% Output : Refutation 4.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 8
% Syntax : Number of formulae : 55 ( 3 unt; 7 typ; 0 def)
% Number of atoms : 164 ( 41 equ; 0 cnn)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 267 ( 75 ~; 77 |; 13 &; 90 @)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 7 con; 0-2 aty)
% Number of variables : 49 ( 0 ^ 41 !; 8 ?; 49 :)
% Comments :
%------------------------------------------------------------------------------
thf(f_type,type,
f: $i > $o ).
thf(sk1_type,type,
sk1: $o ).
thf(sk2_type,type,
sk2: $i ).
thf(sk3_type,type,
sk3: $i > $i ).
thf(sk4_type,type,
sk4: $i ).
thf(sk5_type,type,
sk5: $i ).
thf(sk6_type,type,
sk6: $i ).
thf(1,conjecture,
( ( ? [A: $i] : ( f @ A )
& ! [A: $i,B: $i] :
( ( ( f @ A )
& ( f @ B ) )
=> ( A = B ) ) )
<=> ? [A: $i] :
( ( f @ A )
& ! [B: $i] :
( ( f @ B )
=> ( A = B ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kalish317) ).
thf(2,negated_conjecture,
~ ( ( ? [A: $i] : ( f @ A )
& ! [A: $i,B: $i] :
( ( ( f @ A )
& ( f @ B ) )
=> ( A = B ) ) )
<=> ? [A: $i] :
( ( f @ A )
& ! [B: $i] :
( ( f @ B )
=> ( A = B ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ( ( ? [A: $i] : ( f @ A )
& ! [A: $i,B: $i] :
( ( ( f @ A )
& ( f @ B ) )
=> ( A = B ) ) )
=> ? [A: $i] :
( ( f @ A )
& ! [B: $i] :
( ( f @ B )
=> ( A = B ) ) ) )
& ( ? [A: $i] :
( ( f @ A )
& ! [B: $i] :
( ( f @ B )
=> ( A = B ) ) )
=> ( ? [A: $i] : ( f @ A )
& ! [A: $i,B: $i] :
( ( ( f @ A )
& ( f @ B ) )
=> ( A = B ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(9,plain,
! [A: $i] :
( ~ ( f @ A )
| ( f @ ( sk3 @ A ) )
| ~ sk1 ),
inference(cnf,[status(esa)],[3]) ).
thf(17,plain,
! [A: $i] :
( ~ ( f @ A )
| ( f @ ( sk3 @ A ) )
| ~ sk1 ),
inference(simp,[status(thm)],[9]) ).
thf(8,plain,
! [B: $i,A: $i] :
( ~ ( f @ A )
| ~ ( f @ B )
| ( A = B )
| ~ sk1 ),
inference(cnf,[status(esa)],[3]) ).
thf(21,plain,
! [B: $i,A: $i] :
( ( A = B )
| ~ ( f @ A )
| ~ ( f @ B )
| ~ sk1 ),
inference(lifteq,[status(thm)],[8]) ).
thf(5,plain,
( ( f @ sk2 )
| ~ sk1 ),
inference(cnf,[status(esa)],[3]) ).
thf(10,plain,
! [A: $i] :
( ~ ( f @ A )
| ( A
!= ( sk3 @ A ) )
| ~ sk1 ),
inference(cnf,[status(esa)],[3]) ).
thf(13,plain,
! [A: $i] :
( ( ( sk3 @ A )
!= A )
| ~ ( f @ A )
| ~ sk1 ),
inference(lifteq,[status(thm)],[10]) ).
thf(14,plain,
! [A: $i] :
( ( ( sk3 @ A )
!= A )
| ~ ( f @ A )
| ~ sk1 ),
inference(simp,[status(thm)],[13]) ).
thf(29,plain,
! [A: $i] :
( ~ sk1
| ( ( sk3 @ A )
!= A )
| ( ( f @ sk2 )
!= ( f @ A ) ) ),
inference(paramod_ordered,[status(thm)],[5,14]) ).
thf(30,plain,
( ~ sk1
| ( ( sk3 @ sk2 )
!= sk2 ) ),
inference(pattern_uni,[status(thm)],[29:[bind(A,$thf( sk2 ))]]) ).
thf(105,plain,
! [B: $i,A: $i] :
( ~ ( f @ A )
| ~ ( f @ B )
| ~ sk1
| ( B != sk2 )
| ( A
!= ( sk3 @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[21,30]) ).
thf(106,plain,
! [A: $i] :
( ~ ( f @ ( sk3 @ sk2 ) )
| ~ ( f @ A )
| ~ sk1
| ( A != sk2 ) ),
inference(pattern_uni,[status(thm)],[105:[bind(A,$thf( sk3 @ sk2 )),bind(B,$thf( B ))]]) ).
thf(139,plain,
( ~ ( f @ ( sk3 @ sk2 ) )
| ~ ( f @ sk2 )
| ~ sk1 ),
inference(simp,[status(thm)],[106]) ).
thf(224,plain,
! [A: $i] :
( ~ ( f @ A )
| ~ sk1
| ~ ( f @ sk2 )
| ( ( f @ ( sk3 @ A ) )
!= ( f @ ( sk3 @ sk2 ) ) ) ),
inference(paramod_ordered,[status(thm)],[17,139]) ).
thf(225,plain,
( ~ ( f @ sk2 )
| ~ sk1
| ~ ( f @ sk2 ) ),
inference(pattern_uni,[status(thm)],[224:[bind(A,$thf( sk2 ))]]) ).
thf(228,plain,
( ~ ( f @ sk2 )
| ~ sk1 ),
inference(simp,[status(thm)],[225]) ).
thf(7,plain,
( sk1
| ( f @ sk4 ) ),
inference(cnf,[status(esa)],[3]) ).
thf(12,plain,
! [A: $i] :
( sk1
| ~ ( f @ A )
| ( f @ sk6 ) ),
inference(cnf,[status(esa)],[3]) ).
thf(18,plain,
! [A: $i] :
( sk1
| ~ ( f @ A )
| ( f @ sk6 ) ),
inference(simp,[status(thm)],[12]) ).
thf(27,plain,
! [A: $i] :
( sk1
| ( f @ sk6 )
| ( ( f @ sk4 )
!= ( f @ A ) ) ),
inference(paramod_ordered,[status(thm)],[7,18]) ).
thf(28,plain,
( sk1
| ( f @ sk6 ) ),
inference(pattern_uni,[status(thm)],[27:[bind(A,$thf( sk4 ))]]) ).
thf(4,plain,
! [A: $i] :
( sk1
| ~ ( f @ A )
| ( f @ sk5 ) ),
inference(cnf,[status(esa)],[3]) ).
thf(22,plain,
! [A: $i] :
( sk1
| ~ ( f @ A )
| ( f @ sk5 ) ),
inference(simp,[status(thm)],[4]) ).
thf(39,plain,
! [A: $i] :
( sk1
| ( f @ sk5 )
| ( ( f @ sk6 )
!= ( f @ A ) ) ),
inference(paramod_ordered,[status(thm)],[28,22]) ).
thf(40,plain,
( sk1
| ( f @ sk5 ) ),
inference(pattern_uni,[status(thm)],[39:[bind(A,$thf( sk6 ))]]) ).
thf(6,plain,
! [A: $i] :
( sk1
| ~ ( f @ A )
| ( sk4 = A ) ),
inference(cnf,[status(esa)],[3]) ).
thf(15,plain,
! [A: $i] :
( ( sk4 = A )
| sk1
| ~ ( f @ A ) ),
inference(lifteq,[status(thm)],[6]) ).
thf(16,plain,
! [A: $i] :
( ( sk4 = A )
| sk1
| ~ ( f @ A ) ),
inference(simp,[status(thm)],[15]) ).
thf(64,plain,
! [A: $i] :
( sk1
| ( sk4 = A )
| ( ( f @ sk5 )
!= ( f @ A ) ) ),
inference(paramod_ordered,[status(thm)],[40,16]) ).
thf(65,plain,
( sk1
| ( sk5 = sk4 ) ),
inference(pattern_uni,[status(thm)],[64:[bind(A,$thf( sk5 ))]]) ).
thf(54,plain,
! [A: $i] :
( sk1
| ( sk4 = A )
| ( ( f @ sk6 )
!= ( f @ A ) ) ),
inference(paramod_ordered,[status(thm)],[28,16]) ).
thf(55,plain,
( sk1
| ( sk6 = sk4 ) ),
inference(pattern_uni,[status(thm)],[54:[bind(A,$thf( sk6 ))]]) ).
thf(11,plain,
! [A: $i] :
( sk1
| ~ ( f @ A )
| ( sk5 != sk6 ) ),
inference(cnf,[status(esa)],[3]) ).
thf(19,plain,
! [A: $i] :
( ( sk6 != sk5 )
| sk1
| ~ ( f @ A ) ),
inference(lifteq,[status(thm)],[11]) ).
thf(20,plain,
! [A: $i] :
( ( sk6 != sk5 )
| sk1
| ~ ( f @ A ) ),
inference(simp,[status(thm)],[19]) ).
thf(177,plain,
! [A: $i] :
( sk1
| ( sk6 != sk5 )
| ( ( f @ sk4 )
!= ( f @ A ) ) ),
inference(paramod_ordered,[status(thm)],[7,20]) ).
thf(178,plain,
( sk1
| ( sk6 != sk5 ) ),
inference(pattern_uni,[status(thm)],[177:[bind(A,$thf( sk4 ))]]) ).
thf(198,plain,
( sk1
| ( sk5 != sk4 )
| ( sk6 != sk6 ) ),
inference(paramod_ordered,[status(thm)],[55,178]) ).
thf(199,plain,
( sk1
| ( sk5 != sk4 ) ),
inference(pattern_uni,[status(thm)],[198:[]]) ).
thf(233,plain,
( sk1
| ( sk5 != sk5 ) ),
inference(paramod_ordered,[status(thm)],[65,199]) ).
thf(234,plain,
sk1,
inference(pattern_uni,[status(thm)],[233:[]]) ).
thf(241,plain,
( ( f @ sk2 )
| ~ $true ),
inference(rewrite,[status(thm)],[5,234]) ).
thf(242,plain,
f @ sk2,
inference(simp,[status(thm)],[241]) ).
thf(253,plain,
( ~ $true
| ~ $true ),
inference(rewrite,[status(thm)],[228,242,234]) ).
thf(254,plain,
$false,
inference(simp,[status(thm)],[253]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYN415+1 : TPTP v8.2.0. Released v2.0.0.
% 0.06/0.15 % Command : run_Leo-III %s %d
% 0.15/0.36 % Computer : n022.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 15:25:09 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.94/0.87 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.12/0.96 % [INFO] Parsing done (92ms).
% 1.12/0.97 % [INFO] Running in sequential loop mode.
% 1.58/1.17 % [INFO] nitpick registered as external prover.
% 1.58/1.17 % [INFO] Scanning for conjecture ...
% 1.58/1.22 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.81/1.24 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.81/1.24 % [INFO] Problem is first-order (TPTP FOF).
% 1.81/1.24 % [INFO] Type checking passed.
% 1.81/1.24 % [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.36/1.95 % [INFO] Killing All external provers ...
% 4.36/1.95 % Time passed: 1418ms (effective reasoning time: 979ms)
% 4.36/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.36/1.96 % Axioms used in derivation (0):
% 4.36/1.96 % No. of inferences in proof: 48
% 4.36/1.96 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1418 ms resp. 979 ms w/o parsing
% 4.36/1.99 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.36/1.99 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------