TSTP Solution File: SYN334-1 by Leo-III-SAT---1.7.10
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.10
% Problem : SYN334-1 : TPTP v8.1.2. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n014.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:01:31 EDT 2024
% Result : Unsatisfiable 10.44s 2.99s
% Output : Refutation 10.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 9
% Syntax : Number of formulae : 55 ( 2 unt; 3 typ; 0 def)
% Number of atoms : 162 ( 12 equ; 0 cnn)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 738 ( 86 ~; 86 |; 0 &; 566 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 105 ( 0 ^ 105 !; 0 ?; 105 :)
% Comments :
%------------------------------------------------------------------------------
thf(f_type,type,
f: $i > $i > $o ).
thf(z_type,type,
z: $i > $i > $i ).
thf(g_type,type,
g: $i > $i > $o ).
thf(6,negated_conjecture,
! [B: $i,A: $i] :
( ( g @ A @ B )
| ( g @ ( z @ A @ B ) @ ( z @ A @ B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause6) ).
thf(10,plain,
! [B: $i,A: $i] :
( ( g @ A @ B )
| ( g @ ( z @ A @ B ) @ ( z @ A @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(15,plain,
! [B: $i,A: $i] :
( ( g @ A @ B )
| ( g @ ( z @ A @ B ) @ ( z @ A @ B ) ) ),
inference(cnf,[status(esa)],[10]) ).
thf(5,negated_conjecture,
! [B: $i,A: $i] :
( ~ ( g @ ( z @ A @ B ) @ ( z @ A @ B ) )
| ( f @ A @ B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause5) ).
thf(8,plain,
! [B: $i,A: $i] :
( ~ ( g @ ( z @ A @ B ) @ ( z @ A @ B ) )
| ( f @ A @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(21,plain,
! [B: $i,A: $i] :
( ~ ( g @ ( z @ A @ B ) @ ( z @ A @ B ) )
| ( f @ A @ B ) ),
inference(cnf,[status(esa)],[8]) ).
thf(36,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( g @ A @ B )
| ( f @ C @ D )
| ( ( g @ ( z @ A @ B ) @ ( z @ A @ B ) )
!= ( g @ ( z @ C @ D ) @ ( z @ C @ D ) ) ) ),
inference(paramod_ordered,[status(thm)],[15,21]) ).
thf(37,plain,
! [B: $i,A: $i] :
( ( g @ A @ B )
| ( f @ A @ B ) ),
inference(pattern_uni,[status(thm)],[36:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( A )),bind(D,$thf( B ))]]) ).
thf(7,negated_conjecture,
! [B: $i,A: $i] :
( ~ ( g @ A @ B )
| ~ ( g @ ( z @ A @ B ) @ ( z @ A @ B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause7) ).
thf(12,plain,
! [B: $i,A: $i] :
( ~ ( g @ A @ B )
| ~ ( g @ ( z @ A @ B ) @ ( z @ A @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(19,plain,
! [B: $i,A: $i] :
( ~ ( g @ A @ B )
| ~ ( g @ ( z @ A @ B ) @ ( z @ A @ B ) ) ),
inference(cnf,[status(esa)],[12]) ).
thf(56,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( f @ A @ B )
| ~ ( g @ C @ D )
| ( ( g @ A @ B )
!= ( g @ ( z @ C @ D ) @ ( z @ C @ D ) ) ) ),
inference(paramod_ordered,[status(thm)],[37,19]) ).
thf(57,plain,
! [B: $i,A: $i] :
( ( f @ ( z @ A @ B ) @ ( z @ A @ B ) )
| ~ ( g @ A @ B ) ),
inference(pattern_uni,[status(thm)],[56:[bind(A,$thf( z @ G @ H )),bind(B,$thf( z @ G @ H )),bind(C,$thf( G )),bind(D,$thf( H ))]]) ).
thf(60,plain,
! [B: $i,A: $i] :
( ( f @ ( z @ A @ B ) @ ( z @ A @ B ) )
| ~ ( g @ A @ B ) ),
inference(simp,[status(thm)],[57]) ).
thf(63,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( g @ A @ B )
| ( f @ ( z @ C @ D ) @ ( z @ C @ D ) )
| ( ( g @ ( z @ A @ B ) @ ( z @ A @ B ) )
!= ( g @ C @ D ) ) ),
inference(paramod_ordered,[status(thm)],[15,60]) ).
thf(64,plain,
! [B: $i,A: $i] :
( ( g @ A @ B )
| ( f @ ( z @ ( z @ A @ B ) @ ( z @ A @ B ) ) @ ( z @ ( z @ A @ B ) @ ( z @ A @ B ) ) ) ),
inference(pattern_uni,[status(thm)],[63:[bind(A,$thf( G )),bind(B,$thf( H )),bind(C,$thf( z @ G @ H )),bind(D,$thf( z @ G @ H ))]]) ).
thf(65,plain,
! [B: $i,A: $i] :
( ( g @ A @ B )
| ( f @ ( z @ ( z @ A @ B ) @ ( z @ A @ B ) ) @ ( z @ ( z @ A @ B ) @ ( z @ A @ B ) ) ) ),
inference(simp,[status(thm)],[64]) ).
thf(136,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( f @ ( z @ ( z @ A @ B ) @ ( z @ A @ B ) ) @ ( z @ ( z @ A @ B ) @ ( z @ A @ B ) ) )
| ( f @ ( z @ C @ D ) @ ( z @ C @ D ) )
| ( ( g @ A @ B )
!= ( g @ C @ D ) ) ),
inference(paramod_ordered,[status(thm)],[65,60]) ).
thf(137,plain,
! [B: $i,A: $i] :
( ( f @ ( z @ ( z @ A @ B ) @ ( z @ A @ B ) ) @ ( z @ ( z @ A @ B ) @ ( z @ A @ B ) ) )
| ( f @ ( z @ A @ B ) @ ( z @ A @ B ) ) ),
inference(pattern_uni,[status(thm)],[136:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( A )),bind(D,$thf( B ))]]) ).
thf(1,negated_conjecture,
! [B: $i,A: $i] :
( ~ ( f @ A @ B )
| ( f @ A @ ( z @ A @ B ) )
| ~ ( g @ B @ ( z @ A @ B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause1) ).
thf(9,plain,
! [B: $i,A: $i] :
( ~ ( f @ A @ B )
| ( f @ A @ ( z @ A @ B ) )
| ~ ( g @ B @ ( z @ A @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(17,plain,
! [B: $i,A: $i] :
( ~ ( f @ A @ B )
| ( f @ A @ ( z @ A @ B ) )
| ~ ( g @ B @ ( z @ A @ B ) ) ),
inference(cnf,[status(esa)],[9]) ).
thf(66,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( f @ A @ B )
| ~ ( f @ C @ D )
| ( f @ C @ ( z @ C @ D ) )
| ( ( g @ A @ B )
!= ( g @ D @ ( z @ C @ D ) ) ) ),
inference(paramod_ordered,[status(thm)],[37,17]) ).
thf(67,plain,
! [B: $i,A: $i] :
( ( f @ B @ ( z @ A @ B ) )
| ~ ( f @ A @ B )
| ( f @ A @ ( z @ A @ B ) ) ),
inference(pattern_uni,[status(thm)],[66:[bind(A,$thf( F )),bind(B,$thf( z @ E @ F )),bind(C,$thf( E )),bind(D,$thf( F ))]]) ).
thf(72,plain,
! [B: $i,A: $i] :
( ( f @ B @ ( z @ A @ B ) )
| ~ ( f @ A @ B )
| ( f @ A @ ( z @ A @ B ) ) ),
inference(simp,[status(thm)],[67]) ).
thf(562,plain,
! [B: $i,A: $i] :
( ( f @ B @ ( z @ A @ B ) )
| ~ ( f @ A @ B )
| ( ( f @ A @ ( z @ A @ B ) )
!= ( f @ B @ ( z @ A @ B ) ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[72]) ).
thf(569,plain,
! [A: $i] :
( ( f @ A @ ( z @ A @ A ) )
| ~ ( f @ A @ A ) ),
inference(pattern_uni,[status(thm)],[562:[bind(A,$thf( A )),bind(B,$thf( A ))]]) ).
thf(2,negated_conjecture,
! [B: $i,A: $i] :
( ~ ( f @ A @ B )
| ~ ( f @ A @ ( z @ A @ B ) )
| ( g @ B @ ( z @ A @ B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause2) ).
thf(11,plain,
! [B: $i,A: $i] :
( ~ ( f @ A @ B )
| ~ ( f @ A @ ( z @ A @ B ) )
| ( g @ B @ ( z @ A @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(20,plain,
! [B: $i,A: $i] :
( ~ ( f @ A @ B )
| ~ ( f @ A @ ( z @ A @ B ) )
| ( g @ B @ ( z @ A @ B ) ) ),
inference(cnf,[status(esa)],[11]) ).
thf(609,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( f @ A @ A )
| ~ ( f @ B @ C )
| ( g @ C @ ( z @ B @ C ) )
| ( ( f @ A @ ( z @ A @ A ) )
!= ( f @ B @ ( z @ B @ C ) ) ) ),
inference(paramod_ordered,[status(thm)],[569,20]) ).
thf(610,plain,
! [A: $i] :
( ~ ( f @ A @ A )
| ~ ( f @ A @ A )
| ( g @ A @ ( z @ A @ A ) ) ),
inference(pattern_uni,[status(thm)],[609:[bind(A,$thf( A )),bind(B,$thf( A )),bind(C,$thf( A ))]]) ).
thf(632,plain,
! [A: $i] :
( ~ ( f @ A @ A )
| ( g @ A @ ( z @ A @ A ) ) ),
inference(simp,[status(thm)],[610]) ).
thf(648,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( f @ A @ A )
| ( f @ ( z @ B @ C ) @ ( z @ B @ C ) )
| ( ( g @ A @ ( z @ A @ A ) )
!= ( g @ B @ C ) ) ),
inference(paramod_ordered,[status(thm)],[632,60]) ).
thf(649,plain,
! [A: $i] :
( ~ ( f @ A @ A )
| ( f @ ( z @ A @ ( z @ A @ A ) ) @ ( z @ A @ ( z @ A @ A ) ) ) ),
inference(pattern_uni,[status(thm)],[648:[bind(A,$thf( E )),bind(B,$thf( E )),bind(C,$thf( z @ E @ E ))]]) ).
thf(696,plain,
! [A: $i] :
( ~ ( f @ A @ A )
| ( f @ ( z @ A @ ( z @ A @ A ) ) @ ( z @ A @ ( z @ A @ A ) ) ) ),
inference(simp,[status(thm)],[649]) ).
thf(3,negated_conjecture,
! [B: $i,A: $i] :
( ~ ( f @ ( z @ A @ B ) @ ( z @ A @ B ) )
| ( g @ ( z @ A @ B ) @ ( z @ A @ B ) )
| ~ ( f @ A @ B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).
thf(13,plain,
! [B: $i,A: $i] :
( ~ ( f @ ( z @ A @ B ) @ ( z @ A @ B ) )
| ( g @ ( z @ A @ B ) @ ( z @ A @ B ) )
| ~ ( f @ A @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(18,plain,
! [B: $i,A: $i] :
( ~ ( f @ ( z @ A @ B ) @ ( z @ A @ B ) )
| ( g @ ( z @ A @ B ) @ ( z @ A @ B ) )
| ~ ( f @ A @ B ) ),
inference(cnf,[status(esa)],[13]) ).
thf(199,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ~ ( f @ ( z @ A @ B ) @ ( z @ A @ B ) )
| ~ ( f @ A @ B )
| ~ ( g @ C @ D )
| ( ( g @ ( z @ A @ B ) @ ( z @ A @ B ) )
!= ( g @ ( z @ C @ D ) @ ( z @ C @ D ) ) ) ),
inference(paramod_ordered,[status(thm)],[18,19]) ).
thf(200,plain,
! [B: $i,A: $i] :
( ~ ( f @ ( z @ A @ B ) @ ( z @ A @ B ) )
| ~ ( f @ A @ B )
| ~ ( g @ A @ B ) ),
inference(pattern_uni,[status(thm)],[199:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( A )),bind(D,$thf( B ))]]) ).
thf(880,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( f @ A @ A )
| ~ ( f @ B @ C )
| ~ ( g @ B @ C )
| ( ( f @ ( z @ A @ ( z @ A @ A ) ) @ ( z @ A @ ( z @ A @ A ) ) )
!= ( f @ ( z @ B @ C ) @ ( z @ B @ C ) ) ) ),
inference(paramod_ordered,[status(thm)],[696,200]) ).
thf(881,plain,
! [A: $i] :
( ~ ( f @ A @ A )
| ~ ( f @ A @ ( z @ A @ A ) )
| ~ ( g @ A @ ( z @ A @ A ) ) ),
inference(pattern_uni,[status(thm)],[880:[bind(A,$thf( E )),bind(B,$thf( E )),bind(C,$thf( z @ E @ E ))]]) ).
thf(899,plain,
! [A: $i] :
( ~ ( f @ A @ A )
| ~ ( f @ A @ ( z @ A @ A ) )
| ~ ( g @ A @ ( z @ A @ A ) ) ),
inference(simp,[status(thm)],[881]) ).
thf(934,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( f @ A @ B )
| ~ ( f @ A @ ( z @ A @ B ) )
| ~ ( f @ C @ C )
| ~ ( f @ C @ ( z @ C @ C ) )
| ( ( g @ B @ ( z @ A @ B ) )
!= ( g @ C @ ( z @ C @ C ) ) ) ),
inference(paramod_ordered,[status(thm)],[20,899]) ).
thf(935,plain,
! [A: $i] :
( ~ ( f @ A @ A )
| ~ ( f @ A @ ( z @ A @ A ) )
| ~ ( f @ A @ A )
| ~ ( f @ A @ ( z @ A @ A ) ) ),
inference(pattern_uni,[status(thm)],[934:[bind(A,$thf( A )),bind(B,$thf( A )),bind(C,$thf( A ))]]) ).
thf(977,plain,
! [A: $i] :
( ~ ( f @ A @ A )
| ~ ( f @ A @ ( z @ A @ A ) ) ),
inference(simp,[status(thm)],[935]) ).
thf(1013,plain,
! [B: $i,A: $i] :
( ~ ( f @ A @ A )
| ~ ( f @ B @ B )
| ( ( f @ A @ ( z @ A @ A ) )
!= ( f @ B @ ( z @ B @ B ) ) ) ),
inference(paramod_ordered,[status(thm)],[569,977]) ).
thf(1014,plain,
! [A: $i] :
( ~ ( f @ A @ A )
| ~ ( f @ A @ A ) ),
inference(pattern_uni,[status(thm)],[1013:[bind(A,$thf( A )),bind(B,$thf( A ))]]) ).
thf(1043,plain,
! [A: $i] :
~ ( f @ A @ A ),
inference(simp,[status(thm)],[1014]) ).
thf(1120,plain,
( $false
| $false ),
inference(rewrite,[status(thm)],[137,1043]) ).
thf(1121,plain,
$false,
inference(simp,[status(thm)],[1120]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SYN334-1 : TPTP v8.1.2. Released v1.2.0.
% 0.08/0.16 % Command : run_Leo-III %s %d
% 0.16/0.37 % Computer : n014.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon May 6 21:10:39 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.99/0.90 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.08/1.02 % [INFO] Parsing done (123ms).
% 1.31/1.03 % [INFO] Running in sequential loop mode.
% 1.70/1.24 % [INFO] nitpick registered as external prover.
% 1.70/1.24 % [INFO] Scanning for conjecture ...
% 1.90/1.30 % [INFO] Found a conjecture and 0 axioms. Running axiom selection ...
% 1.90/1.34 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.90/1.34 % [INFO] Problem is propositional (TPTP CNF).
% 1.90/1.34 % [INFO] Type checking passed.
% 1.90/1.34 % [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 ...
% 10.44/2.98 % [INFO] Killing All external provers ...
% 10.44/2.98 % Time passed: 2449ms (effective reasoning time: 1944ms)
% 10.44/2.98 % 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)>
% 10.44/2.99 % Axioms used in derivation (0):
% 10.44/2.99 % No. of inferences in proof: 52
% 10.44/2.99 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2449 ms resp. 1944 ms w/o parsing
% 10.44/3.05 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 10.44/3.05 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------