TSTP Solution File: SYN571-1 by Leo-III-SAT---1.7.10
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.10
% Problem : SYN571-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n029.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 7 11:02:19 EDT 2024
% Result : Unsatisfiable 159.94s 24.02s
% Output : Refutation 159.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 19
% Syntax : Number of formulae : 54 ( 19 unt; 11 typ; 0 def)
% Number of atoms : 98 ( 8 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 385 ( 43 ~; 39 |; 0 &; 303 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 14 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 11 usr; 3 con; 0-2 aty)
% Number of variables : 101 ( 0 ^ 101 !; 0 ?; 101 :)
% Comments :
%------------------------------------------------------------------------------
thf(p2_type,type,
p2: $i > $i > $o ).
thf(p11_type,type,
p11: $i > $i > $o ).
thf(f5_type,type,
f5: $i > $i ).
thf(c14_type,type,
c14: $i ).
thf(f3_type,type,
f3: $i > $i > $i ).
thf(f6_type,type,
f6: $i > $i ).
thf(f7_type,type,
f7: $i > $i ).
thf(c12_type,type,
c12: $i ).
thf(f10_type,type,
f10: $i > $i ).
thf(f9_type,type,
f9: $i > $i > $i ).
thf(f8_type,type,
f8: $i > $i > $i ).
thf(14,negated_conjecture,
! [B: $i,A: $i] : ( p2 @ ( f9 @ ( f5 @ A ) @ ( f5 @ B ) ) @ ( f5 @ ( f8 @ A @ B ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_14) ).
thf(23,plain,
! [B: $i,A: $i] : ( p2 @ ( f9 @ ( f5 @ A ) @ ( f5 @ B ) ) @ ( f5 @ ( f8 @ A @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[14]) ).
thf(2,negated_conjecture,
! [A: $i] : ( p2 @ A @ A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_2) ).
thf(29,plain,
! [A: $i] : ( p2 @ A @ A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(12,negated_conjecture,
! [C: $i,B: $i,A: $i] :
( ( p2 @ A @ B )
| ~ ( p2 @ C @ A )
| ~ ( p2 @ C @ B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_12) ).
thf(31,plain,
! [C: $i,B: $i,A: $i] :
( ( p2 @ A @ B )
| ~ ( p2 @ C @ A )
| ~ ( p2 @ C @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).
thf(43,plain,
! [C: $i,B: $i,A: $i] :
( ( p2 @ A @ B )
| ~ ( p2 @ C @ A )
| ~ ( p2 @ C @ B ) ),
inference(cnf,[status(esa)],[31]) ).
thf(290,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( p2 @ B @ C )
| ~ ( p2 @ D @ B )
| ( ( p2 @ A @ A )
!= ( p2 @ D @ C ) ) ),
inference(paramod_ordered,[status(thm)],[29,43]) ).
thf(291,plain,
! [B: $i,A: $i] :
( ( p2 @ B @ A )
| ~ ( p2 @ A @ B ) ),
inference(pattern_uni,[status(thm)],[290:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( A )),bind(D,$thf( A ))]]) ).
thf(4820,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( p2 @ D @ C )
| ( ( p2 @ ( f9 @ ( f5 @ A ) @ ( f5 @ B ) ) @ ( f5 @ ( f8 @ A @ B ) ) )
!= ( p2 @ C @ D ) ) ),
inference(paramod_ordered,[status(thm)],[23,291]) ).
thf(4821,plain,
! [B: $i,A: $i] : ( p2 @ ( f5 @ ( f8 @ A @ B ) ) @ ( f9 @ ( f5 @ A ) @ ( f5 @ B ) ) ),
inference(pattern_uni,[status(thm)],[4820:[bind(A,$thf( J )),bind(B,$thf( K )),bind(C,$thf( f9 @ ( f5 @ J ) @ ( f5 @ K ) )),bind(D,$thf( f5 @ ( f8 @ J @ K ) ))]]) ).
thf(4868,plain,
! [B: $i,A: $i] : ( p2 @ ( f5 @ ( f8 @ A @ B ) ) @ ( f9 @ ( f5 @ A ) @ ( f5 @ B ) ) ),
inference(simp,[status(thm)],[4821]) ).
thf(3,negated_conjecture,
! [A: $i] : ( p11 @ ( f5 @ A ) @ c14 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p11_3) ).
thf(33,plain,
! [A: $i] : ( p11 @ ( f5 @ A ) @ c14 ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(17,negated_conjecture,
! [D: $i,C: $i,B: $i,A: $i] :
( ( p11 @ A @ B )
| ~ ( p2 @ C @ A )
| ~ ( p2 @ D @ B )
| ~ ( p11 @ C @ D ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p11_17) ).
thf(30,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( p11 @ A @ B )
| ~ ( p2 @ C @ A )
| ~ ( p2 @ D @ B )
| ~ ( p11 @ C @ D ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[17]) ).
thf(56,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( p11 @ A @ B )
| ~ ( p2 @ C @ A )
| ~ ( p2 @ D @ B )
| ~ ( p11 @ C @ D ) ),
inference(cnf,[status(esa)],[30]) ).
thf(104,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( p11 @ B @ C )
| ~ ( p2 @ D @ B )
| ~ ( p11 @ D @ E )
| ( ( p2 @ A @ A )
!= ( p2 @ E @ C ) ) ),
inference(paramod_ordered,[status(thm)],[29,56]) ).
thf(105,plain,
! [C: $i,B: $i,A: $i] :
( ( p11 @ B @ A )
| ~ ( p2 @ C @ B )
| ~ ( p11 @ C @ A ) ),
inference(pattern_uni,[status(thm)],[104:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( A )),bind(D,$thf( D )),bind(E,$thf( A ))]]) ).
thf(113,plain,
! [C: $i,B: $i,A: $i] :
( ( p11 @ B @ A )
| ~ ( p2 @ C @ B )
| ~ ( p11 @ C @ A ) ),
inference(simp,[status(thm)],[105]) ).
thf(3355,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( p11 @ C @ B )
| ~ ( p2 @ D @ C )
| ( ( p11 @ ( f5 @ A ) @ c14 )
!= ( p11 @ D @ B ) ) ),
inference(paramod_ordered,[status(thm)],[33,113]) ).
thf(3356,plain,
! [B: $i,A: $i] :
( ( p11 @ A @ c14 )
| ~ ( p2 @ ( f5 @ B ) @ A ) ),
inference(pattern_uni,[status(thm)],[3355:[bind(A,$thf( E )),bind(B,$thf( c14 )),bind(C,$thf( C )),bind(D,$thf( f5 @ E ))]]) ).
thf(3452,plain,
! [B: $i,A: $i] :
( ( p11 @ A @ c14 )
| ~ ( p2 @ ( f5 @ B ) @ A ) ),
inference(simp,[status(thm)],[3356]) ).
thf(23823,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( p11 @ C @ c14 )
| ( ( p2 @ ( f5 @ ( f8 @ A @ B ) ) @ ( f9 @ ( f5 @ A ) @ ( f5 @ B ) ) )
!= ( p2 @ ( f5 @ D ) @ C ) ) ),
inference(paramod_ordered,[status(thm)],[4868,3452]) ).
thf(23824,plain,
! [B: $i,A: $i] : ( p11 @ ( f9 @ ( f5 @ A ) @ ( f5 @ B ) ) @ c14 ),
inference(pattern_uni,[status(thm)],[23823:[bind(A,$thf( I )),bind(B,$thf( J )),bind(C,$thf( f9 @ ( f5 @ I ) @ ( f5 @ J ) )),bind(D,$thf( f8 @ I @ J ))]]) ).
thf(23886,plain,
! [B: $i,A: $i] : ( p11 @ ( f9 @ ( f5 @ A ) @ ( f5 @ B ) ) @ c14 ),
inference(simp,[status(thm)],[23824]) ).
thf(15,negated_conjecture,
! [C: $i,B: $i,A: $i] :
( ( p11 @ A @ ( f3 @ B @ C ) )
| ~ ( p11 @ ( f9 @ A @ C ) @ B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p11_15) ).
thf(40,plain,
! [C: $i,B: $i,A: $i] :
( ( p11 @ A @ ( f3 @ B @ C ) )
| ~ ( p11 @ ( f9 @ A @ C ) @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[15]) ).
thf(53,plain,
! [C: $i,B: $i,A: $i] :
( ( p11 @ A @ ( f3 @ B @ C ) )
| ~ ( p11 @ ( f9 @ A @ C ) @ B ) ),
inference(cnf,[status(esa)],[40]) ).
thf(24663,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( p11 @ C @ ( f3 @ D @ E ) )
| ( ( p11 @ ( f9 @ ( f5 @ A ) @ ( f5 @ B ) ) @ c14 )
!= ( p11 @ ( f9 @ C @ E ) @ D ) ) ),
inference(paramod_ordered,[status(thm)],[23886,53]) ).
thf(24664,plain,
! [B: $i,A: $i] : ( p11 @ ( f5 @ A ) @ ( f3 @ c14 @ ( f5 @ B ) ) ),
inference(pattern_uni,[status(thm)],[24663:[bind(A,$thf( F )),bind(B,$thf( G )),bind(C,$thf( f5 @ F )),bind(D,$thf( c14 )),bind(E,$thf( f5 @ G ))]]) ).
thf(24730,plain,
! [B: $i,A: $i] : ( p11 @ ( f5 @ A ) @ ( f3 @ c14 @ ( f5 @ B ) ) ),
inference(simp,[status(thm)],[24664]) ).
thf(7,negated_conjecture,
! [A: $i] :
( ( p11 @ c14 @ A )
| ~ ( p11 @ ( f5 @ ( f10 @ A ) ) @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p11_7) ).
thf(32,plain,
! [A: $i] :
( ( p11 @ c14 @ A )
| ~ ( p11 @ ( f5 @ ( f10 @ A ) ) @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(49,plain,
! [A: $i] :
( ( p11 @ c14 @ A )
| ~ ( p11 @ ( f5 @ ( f10 @ A ) ) @ A ) ),
inference(cnf,[status(esa)],[32]) ).
thf(24774,plain,
! [C: $i,B: $i,A: $i] :
( ( p11 @ c14 @ C )
| ( ( p11 @ ( f5 @ A ) @ ( f3 @ c14 @ ( f5 @ B ) ) )
!= ( p11 @ ( f5 @ ( f10 @ C ) ) @ C ) ) ),
inference(paramod_ordered,[status(thm)],[24730,49]) ).
thf(24775,plain,
! [A: $i] : ( p11 @ c14 @ ( f3 @ c14 @ ( f5 @ A ) ) ),
inference(pattern_uni,[status(thm)],[24774:[bind(A,$thf( f10 @ ( f3 @ c14 @ ( f5 @ G ) ) )),bind(B,$thf( G )),bind(C,$thf( f3 @ c14 @ ( f5 @ G ) ))]]) ).
thf(24820,plain,
! [A: $i] : ( p11 @ c14 @ ( f3 @ c14 @ ( f5 @ A ) ) ),
inference(simp,[status(thm)],[24775]) ).
thf(6,negated_conjecture,
! [A: $i] :
~ ( p11 @ A @ ( f3 @ A @ ( f5 @ ( f6 @ ( f7 @ c12 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p11_6) ).
thf(26,plain,
! [A: $i] :
~ ( p11 @ A @ ( f3 @ A @ ( f5 @ ( f6 @ ( f7 @ c12 ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(54,plain,
! [A: $i] :
~ ( p11 @ A @ ( f3 @ A @ ( f5 @ ( f6 @ ( f7 @ c12 ) ) ) ) ),
inference(polarity_switch,[status(thm)],[26]) ).
thf(24879,plain,
! [B: $i,A: $i] :
( ( p11 @ c14 @ ( f3 @ c14 @ ( f5 @ A ) ) )
!= ( p11 @ B @ ( f3 @ B @ ( f5 @ ( f6 @ ( f7 @ c12 ) ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[24820,54]) ).
thf(24880,plain,
$false,
inference(pattern_uni,[status(thm)],[24879:[bind(A,$thf( f6 @ ( f7 @ c12 ) )),bind(B,$thf( c14 ))]]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SYN571-1 : TPTP v8.1.2. Released v2.5.0.
% 0.02/0.12 % Command : run_Leo-III %s %d
% 0.11/0.32 % Computer : n029.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon May 6 21:06:42 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.91/0.93 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.28/1.11 % [INFO] Parsing done (177ms).
% 1.28/1.12 % [INFO] Running in sequential loop mode.
% 1.90/1.48 % [INFO] nitpick registered as external prover.
% 1.90/1.49 % [INFO] Scanning for conjecture ...
% 2.08/1.60 % [INFO] Found a conjecture and 0 axioms. Running axiom selection ...
% 2.34/1.68 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.34/1.68 % [INFO] Problem is propositional (TPTP CNF).
% 2.34/1.69 % [INFO] Type checking passed.
% 2.34/1.69 % [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 ...
% 159.94/24.01 % [INFO] Killing All external provers ...
% 159.94/24.02 % Time passed: 23534ms (effective reasoning time: 22885ms)
% 159.94/24.02 % 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)>
% 159.94/24.02 % Axioms used in derivation (0):
% 159.94/24.02 % No. of inferences in proof: 43
% 159.94/24.02 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 23534 ms resp. 22885 ms w/o parsing
% 159.94/24.04 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 159.94/24.04 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------