TSTP Solution File: SYN354-1 by Leo-III-SAT---1.7.10
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.10
% Problem : SYN354-1 : TPTP v8.1.2. Released v1.2.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 : Tue May 7 11:01:40 EDT 2024
% Result : Unsatisfiable 4.06s 1.95s
% Output : Refutation 4.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 30 ( 5 unt; 5 typ; 0 def)
% Number of atoms : 74 ( 3 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 259 ( 38 ~; 43 |; 0 &; 178 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 24 ( 0 ^ 24 !; 0 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
thf(f_type,type,
f: $i > $i > $o ).
thf(a_type,type,
a: $i ).
thf(b_type,type,
b: $i ).
thf(g_type,type,
g: $i > $i > $o ).
thf(z_type,type,
z: $i > $i > $i ).
thf(1,negated_conjecture,
f @ a @ b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause1) ).
thf(9,plain,
f @ a @ b,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(4,negated_conjecture,
! [B: $i,A: $i] :
( ~ ( g @ b @ ( z @ A @ B ) )
| ~ ( g @ B @ ( z @ A @ B ) )
| ~ ( f @ A @ B )
| ( f @ b @ B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause4) ).
thf(14,plain,
! [B: $i,A: $i] :
( ~ ( g @ b @ ( z @ A @ B ) )
| ~ ( g @ B @ ( z @ A @ B ) )
| ~ ( f @ A @ B )
| ( f @ b @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(16,plain,
! [B: $i,A: $i] :
( ~ ( g @ b @ ( z @ A @ B ) )
| ~ ( g @ B @ ( z @ A @ B ) )
| ~ ( f @ A @ B )
| ( f @ b @ B ) ),
inference(cnf,[status(esa)],[14]) ).
thf(74,plain,
! [B: $i,A: $i] :
( ~ ( g @ b @ ( z @ A @ B ) )
| ~ ( g @ B @ ( z @ A @ B ) )
| ( f @ b @ B )
| ( ( f @ a @ b )
!= ( f @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[9,16]) ).
thf(75,plain,
( ~ ( g @ b @ ( z @ a @ b ) )
| ~ ( g @ b @ ( z @ a @ b ) )
| ( f @ b @ b ) ),
inference(pattern_uni,[status(thm)],[74:[bind(A,$thf( a )),bind(B,$thf( b ))]]) ).
thf(98,plain,
( ~ ( g @ b @ ( z @ a @ b ) )
| ( f @ b @ b ) ),
inference(simp,[status(thm)],[75]) ).
thf(7,negated_conjecture,
! [B: $i,A: $i] :
( ~ ( f @ a @ A )
| ~ ( f @ b @ A )
| ~ ( f @ A @ B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause7) ).
thf(12,plain,
! [B: $i,A: $i] :
( ~ ( f @ a @ A )
| ~ ( f @ b @ A )
| ~ ( f @ A @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(18,plain,
! [B: $i,A: $i] :
( ~ ( f @ a @ A )
| ~ ( f @ b @ A )
| ~ ( f @ A @ B ) ),
inference(cnf,[status(esa)],[12]) ).
thf(38,plain,
! [B: $i,A: $i] :
( ~ ( f @ a @ A )
| ~ ( f @ b @ A )
| ( ( f @ A @ B )
!= ( f @ b @ A ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[18]) ).
thf(42,plain,
( ~ ( f @ a @ b )
| ~ ( f @ b @ b ) ),
inference(pattern_uni,[status(thm)],[38:[bind(A,$thf( b )),bind(B,$thf( b ))]]) ).
thf(100,plain,
( ~ $true
| ~ ( f @ b @ b ) ),
inference(rewrite,[status(thm)],[42,9]) ).
thf(101,plain,
~ ( f @ b @ b ),
inference(simp,[status(thm)],[100]) ).
thf(3,negated_conjecture,
! [B: $i,A: $i] :
( ( g @ b @ ( z @ A @ B ) )
| ( g @ B @ ( z @ A @ B ) )
| ~ ( f @ A @ B )
| ( f @ b @ B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause3) ).
thf(13,plain,
! [B: $i,A: $i] :
( ( g @ b @ ( z @ A @ B ) )
| ( g @ B @ ( z @ A @ B ) )
| ~ ( f @ A @ B )
| ( f @ b @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(17,plain,
! [B: $i,A: $i] :
( ( g @ b @ ( z @ A @ B ) )
| ( g @ B @ ( z @ A @ B ) )
| ~ ( f @ A @ B )
| ( f @ b @ B ) ),
inference(cnf,[status(esa)],[13]) ).
thf(57,plain,
! [B: $i,A: $i] :
( ( g @ b @ ( z @ A @ B ) )
| ( g @ B @ ( z @ A @ B ) )
| ( f @ b @ B )
| ( ( f @ a @ b )
!= ( f @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[9,17]) ).
thf(58,plain,
( ( g @ b @ ( z @ a @ b ) )
| ( g @ b @ ( z @ a @ b ) )
| ( f @ b @ b ) ),
inference(pattern_uni,[status(thm)],[57:[bind(A,$thf( a )),bind(B,$thf( b ))]]) ).
thf(69,plain,
( ( g @ b @ ( z @ a @ b ) )
| ( f @ b @ b ) ),
inference(simp,[status(thm)],[58]) ).
thf(120,plain,
( ( g @ b @ ( z @ a @ b ) )
| $false ),
inference(rewrite,[status(thm)],[69,101]) ).
thf(121,plain,
g @ b @ ( z @ a @ b ),
inference(simp,[status(thm)],[120]) ).
thf(140,plain,
( ~ $true
| $false ),
inference(rewrite,[status(thm)],[98,101,121]) ).
thf(141,plain,
$false,
inference(simp,[status(thm)],[140]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN354-1 : TPTP v8.1.2. Released v1.2.0.
% 0.07/0.16 % Command : run_Leo-III %s %d
% 0.17/0.37 % Computer : n004.cluster.edu
% 0.17/0.37 % Model : x86_64 x86_64
% 0.17/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.37 % Memory : 8042.1875MB
% 0.17/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.37 % CPULimit : 300
% 0.17/0.37 % WCLimit : 300
% 0.17/0.37 % DateTime : Mon May 6 20:55:24 EDT 2024
% 0.17/0.38 % CPUTime :
% 0.95/0.86 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.19/0.98 % [INFO] Parsing done (112ms).
% 1.19/0.98 % [INFO] Running in sequential loop mode.
% 1.71/1.20 % [INFO] nitpick registered as external prover.
% 1.71/1.21 % [INFO] Scanning for conjecture ...
% 1.84/1.27 % [INFO] Found a conjecture and 0 axioms. Running axiom selection ...
% 1.84/1.30 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.84/1.31 % [INFO] Problem is propositional (TPTP CNF).
% 1.84/1.31 % [INFO] Type checking passed.
% 1.84/1.31 % [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.06/1.95 % [INFO] Killing All external provers ...
% 4.06/1.95 % Time passed: 1413ms (effective reasoning time: 962ms)
% 4.06/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.06/1.95 % Axioms used in derivation (0):
% 4.06/1.95 % No. of inferences in proof: 25
% 4.06/1.95 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1413 ms resp. 962 ms w/o parsing
% 4.06/2.00 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.06/2.00 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------