TSTP Solution File: NUM376+1.010 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : NUM376+1.010 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n001.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 : Fri May 19 11:40:23 EDT 2023
% Result : Unsatisfiable 8.76s 5.73s
% Output : Refutation 9.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 15
% Syntax : Number of formulae : 17 ( 1 unt; 14 typ; 0 def)
% Number of atoms : 443 ( 442 equ; 0 cnn)
% Maximal formula atoms : 221 ( 147 avg)
% Number of connectives : 1120 ( 112 ~; 40 |; 400 &; 568 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 204 ( 136 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 12 con; 0-2 aty)
% Number of variables : 4 ( 0 ^; 0 !; 4 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
thf(succ_type,type,
succ: $i > $i ).
thf(n0_type,type,
n0: $i ).
thf(n1_type,type,
n1: $i ).
thf(n2_type,type,
n2: $i ).
thf(n3_type,type,
n3: $i ).
thf(n4_type,type,
n4: $i ).
thf(n5_type,type,
n5: $i ).
thf(n6_type,type,
n6: $i ).
thf(n7_type,type,
n7: $i ).
thf(n8_type,type,
n8: $i ).
thf(n9_type,type,
n9: $i ).
thf(n10_type,type,
n10: $i ).
thf(pred_type,type,
pred: $i > $i ).
thf(sum_type,type,
sum: $i > $i > $i ).
thf(1,axiom,
? [A: $i,B: $i] :
( ( ( succ @ n0 )
= n1 )
& ( ( succ @ n1 )
= n2 )
& ( ( succ @ n2 )
= n3 )
& ( ( succ @ n3 )
= n4 )
& ( ( succ @ n4 )
= n5 )
& ( ( succ @ n5 )
= n6 )
& ( ( succ @ n6 )
= n7 )
& ( ( succ @ n7 )
= n8 )
& ( ( succ @ n8 )
= n9 )
& ( ( succ @ n9 )
= n10 )
& ( ( succ @ n10 )
= n0 )
& ( ( pred @ n0 )
= n10 )
& ( ( pred @ n1 )
= n0 )
& ( ( pred @ n2 )
= n1 )
& ( ( pred @ n3 )
= n2 )
& ( ( pred @ n4 )
= n3 )
& ( ( pred @ n5 )
= n4 )
& ( ( pred @ n6 )
= n5 )
& ( ( pred @ n7 )
= n6 )
& ( ( pred @ n8 )
= n7 )
& ( ( pred @ n9 )
= n8 )
& ( ( pred @ n10 )
= n9 )
& ( ( sum @ n0 @ n0 )
= n0 )
& ( ( sum @ n0 @ n1 )
= n1 )
& ( ( sum @ n0 @ n2 )
= n2 )
& ( ( sum @ n0 @ n3 )
= n3 )
& ( ( sum @ n0 @ n4 )
= n4 )
& ( ( sum @ n0 @ n5 )
= n5 )
& ( ( sum @ n0 @ n6 )
= n6 )
& ( ( sum @ n0 @ n7 )
= n7 )
& ( ( sum @ n0 @ n8 )
= n8 )
& ( ( sum @ n0 @ n9 )
= n9 )
& ( ( sum @ n0 @ n10 )
= n10 )
& ( ( sum @ n1 @ n0 )
= n1 )
& ( ( sum @ n1 @ n1 )
= n2 )
& ( ( sum @ n1 @ n2 )
= n3 )
& ( ( sum @ n1 @ n3 )
= n4 )
& ( ( sum @ n1 @ n4 )
= n5 )
& ( ( sum @ n1 @ n5 )
= n6 )
& ( ( sum @ n1 @ n6 )
= n7 )
& ( ( sum @ n1 @ n7 )
= n8 )
& ( ( sum @ n1 @ n8 )
= n9 )
& ( ( sum @ n1 @ n9 )
= n10 )
& ( ( sum @ n1 @ n10 )
= n0 )
& ( ( sum @ n2 @ n0 )
= n2 )
& ( ( sum @ n2 @ n1 )
= n3 )
& ( ( sum @ n2 @ n2 )
= n4 )
& ( ( sum @ n2 @ n3 )
= n5 )
& ( ( sum @ n2 @ n4 )
= n6 )
& ( ( sum @ n2 @ n5 )
= n7 )
& ( ( sum @ n2 @ n6 )
= n8 )
& ( ( sum @ n2 @ n7 )
= n9 )
& ( ( sum @ n2 @ n8 )
= n10 )
& ( ( sum @ n2 @ n9 )
= n0 )
& ( ( sum @ n2 @ n10 )
= n1 )
& ( ( sum @ n3 @ n0 )
= n3 )
& ( ( sum @ n3 @ n1 )
= n4 )
& ( ( sum @ n3 @ n2 )
= n5 )
& ( ( sum @ n3 @ n3 )
= n6 )
& ( ( sum @ n3 @ n4 )
= n7 )
& ( ( sum @ n3 @ n5 )
= n8 )
& ( ( sum @ n3 @ n6 )
= n9 )
& ( ( sum @ n3 @ n7 )
= n10 )
& ( ( sum @ n3 @ n8 )
= n0 )
& ( ( sum @ n3 @ n9 )
= n1 )
& ( ( sum @ n3 @ n10 )
= n2 )
& ( ( sum @ n4 @ n0 )
= n4 )
& ( ( sum @ n4 @ n1 )
= n5 )
& ( ( sum @ n4 @ n2 )
= n6 )
& ( ( sum @ n4 @ n3 )
= n7 )
& ( ( sum @ n4 @ n4 )
= n8 )
& ( ( sum @ n4 @ n5 )
= n9 )
& ( ( sum @ n4 @ n6 )
= n10 )
& ( ( sum @ n4 @ n7 )
= n0 )
& ( ( sum @ n4 @ n8 )
= n1 )
& ( ( sum @ n4 @ n9 )
= n2 )
& ( ( sum @ n4 @ n10 )
= n3 )
& ( ( sum @ n5 @ n0 )
= n5 )
& ( ( sum @ n5 @ n1 )
= n6 )
& ( ( sum @ n5 @ n2 )
= n7 )
& ( ( sum @ n5 @ n3 )
= n8 )
& ( ( sum @ n5 @ n4 )
= n9 )
& ( ( sum @ n5 @ n5 )
= n10 )
& ( ( sum @ n5 @ n6 )
= n0 )
& ( ( sum @ n5 @ n7 )
= n1 )
& ( ( sum @ n5 @ n8 )
= n2 )
& ( ( sum @ n5 @ n9 )
= n3 )
& ( ( sum @ n5 @ n10 )
= n4 )
& ( ( sum @ n6 @ n0 )
= n6 )
& ( ( sum @ n6 @ n1 )
= n7 )
& ( ( sum @ n6 @ n2 )
= n8 )
& ( ( sum @ n6 @ n3 )
= n9 )
& ( ( sum @ n6 @ n4 )
= n10 )
& ( ( sum @ n6 @ n5 )
= n0 )
& ( ( sum @ n6 @ n6 )
= n1 )
& ( ( sum @ n6 @ n7 )
= n2 )
& ( ( sum @ n6 @ n8 )
= n3 )
& ( ( sum @ n6 @ n9 )
= n4 )
& ( ( sum @ n6 @ n10 )
= n5 )
& ( ( sum @ n7 @ n0 )
= n7 )
& ( ( sum @ n7 @ n1 )
= n8 )
& ( ( sum @ n7 @ n2 )
= n9 )
& ( ( sum @ n7 @ n3 )
= n10 )
& ( ( sum @ n7 @ n4 )
= n0 )
& ( ( sum @ n7 @ n5 )
= n1 )
& ( ( sum @ n7 @ n6 )
= n2 )
& ( ( sum @ n7 @ n7 )
= n3 )
& ( ( sum @ n7 @ n8 )
= n4 )
& ( ( sum @ n7 @ n9 )
= n5 )
& ( ( sum @ n7 @ n10 )
= n6 )
& ( ( sum @ n8 @ n0 )
= n8 )
& ( ( sum @ n8 @ n1 )
= n9 )
& ( ( sum @ n8 @ n2 )
= n10 )
& ( ( sum @ n8 @ n3 )
= n0 )
& ( ( sum @ n8 @ n4 )
= n1 )
& ( ( sum @ n8 @ n5 )
= n2 )
& ( ( sum @ n8 @ n6 )
= n3 )
& ( ( sum @ n8 @ n7 )
= n4 )
& ( ( sum @ n8 @ n8 )
= n5 )
& ( ( sum @ n8 @ n9 )
= n6 )
& ( ( sum @ n8 @ n10 )
= n7 )
& ( ( sum @ n9 @ n0 )
= n9 )
& ( ( sum @ n9 @ n1 )
= n10 )
& ( ( sum @ n9 @ n2 )
= n0 )
& ( ( sum @ n9 @ n3 )
= n1 )
& ( ( sum @ n9 @ n4 )
= n2 )
& ( ( sum @ n9 @ n5 )
= n3 )
& ( ( sum @ n9 @ n6 )
= n4 )
& ( ( sum @ n9 @ n7 )
= n5 )
& ( ( sum @ n9 @ n8 )
= n6 )
& ( ( sum @ n9 @ n9 )
= n7 )
& ( ( sum @ n9 @ n10 )
= n8 )
& ( ( sum @ n10 @ n0 )
= n10 )
& ( ( sum @ n10 @ n1 )
= n0 )
& ( ( sum @ n10 @ n2 )
= n1 )
& ( ( sum @ n10 @ n3 )
= n2 )
& ( ( sum @ n10 @ n4 )
= n3 )
& ( ( sum @ n10 @ n5 )
= n4 )
& ( ( sum @ n10 @ n6 )
= n5 )
& ( ( sum @ n10 @ n7 )
= n6 )
& ( ( sum @ n10 @ n8 )
= n7 )
& ( ( sum @ n10 @ n9 )
= n8 )
& ( ( sum @ n10 @ n10 )
= n9 )
& ( ( A = n0 )
| ( A = n1 )
| ( A = n2 )
| ( A = n3 )
| ( A = n4 )
| ( A = n5 )
| ( A = n6 )
| ( A = n7 )
| ( A = n8 )
| ( A = n9 )
| ( A = n10 ) )
& ( ( B = n0 )
| ( B = n1 )
| ( B = n2 )
| ( B = n3 )
| ( B = n4 )
| ( B = n5 )
| ( B = n6 )
| ( B = n7 )
| ( B = n8 )
| ( B = n9 )
| ( B = n10 ) )
& ( ( sum @ ( sum @ ( pred @ A ) @ ( succ @ B ) ) @ ( sum @ ( pred @ B ) @ ( succ @ A ) ) )
!= ( sum @ ( sum @ ( pred @ A ) @ ( succ @ A ) ) @ ( sum @ ( pred @ B ) @ ( succ @ B ) ) ) )
& ( n0 != n1 )
& ( n0 != n2 )
& ( n0 != n3 )
& ( n0 != n4 )
& ( n0 != n5 )
& ( n0 != n6 )
& ( n0 != n7 )
& ( n0 != n8 )
& ( n0 != n9 )
& ( n0 != n10 )
& ( n1 != n2 )
& ( n1 != n3 )
& ( n1 != n4 )
& ( n1 != n5 )
& ( n1 != n6 )
& ( n1 != n7 )
& ( n1 != n8 )
& ( n1 != n9 )
& ( n1 != n10 )
& ( n2 != n3 )
& ( n2 != n4 )
& ( n2 != n5 )
& ( n2 != n6 )
& ( n2 != n7 )
& ( n2 != n8 )
& ( n2 != n9 )
& ( n2 != n10 )
& ( n3 != n4 )
& ( n3 != n5 )
& ( n3 != n6 )
& ( n3 != n7 )
& ( n3 != n8 )
& ( n3 != n9 )
& ( n3 != n10 )
& ( n4 != n5 )
& ( n4 != n6 )
& ( n4 != n7 )
& ( n4 != n8 )
& ( n4 != n9 )
& ( n4 != n10 )
& ( n5 != n6 )
& ( n5 != n7 )
& ( n5 != n8 )
& ( n5 != n9 )
& ( n5 != n10 )
& ( n6 != n7 )
& ( n6 != n8 )
& ( n6 != n9 )
& ( n6 != n10 )
& ( n7 != n8 )
& ( n7 != n9 )
& ( n7 != n10 )
& ( n8 != n9 )
& ( n8 != n10 )
& ( n9 != n10 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',try_satisfy_this) ).
thf(2,plain,
? [A: $i,B: $i] :
( ( ( succ @ n0 )
= n1 )
& ( ( succ @ n1 )
= n2 )
& ( ( succ @ n2 )
= n3 )
& ( ( succ @ n3 )
= n4 )
& ( ( succ @ n4 )
= n5 )
& ( ( succ @ n5 )
= n6 )
& ( ( succ @ n6 )
= n7 )
& ( ( succ @ n7 )
= n8 )
& ( ( succ @ n8 )
= n9 )
& ( ( succ @ n9 )
= n10 )
& ( ( succ @ n10 )
= n0 )
& ( ( pred @ n0 )
= n10 )
& ( ( pred @ n1 )
= n0 )
& ( ( pred @ n2 )
= n1 )
& ( ( pred @ n3 )
= n2 )
& ( ( pred @ n4 )
= n3 )
& ( ( pred @ n5 )
= n4 )
& ( ( pred @ n6 )
= n5 )
& ( ( pred @ n7 )
= n6 )
& ( ( pred @ n8 )
= n7 )
& ( ( pred @ n9 )
= n8 )
& ( ( pred @ n10 )
= n9 )
& ( ( sum @ n0 @ n0 )
= n0 )
& ( ( sum @ n0 @ n1 )
= n1 )
& ( ( sum @ n0 @ n2 )
= n2 )
& ( ( sum @ n0 @ n3 )
= n3 )
& ( ( sum @ n0 @ n4 )
= n4 )
& ( ( sum @ n0 @ n5 )
= n5 )
& ( ( sum @ n0 @ n6 )
= n6 )
& ( ( sum @ n0 @ n7 )
= n7 )
& ( ( sum @ n0 @ n8 )
= n8 )
& ( ( sum @ n0 @ n9 )
= n9 )
& ( ( sum @ n0 @ n10 )
= n10 )
& ( ( sum @ n1 @ n0 )
= n1 )
& ( ( sum @ n1 @ n1 )
= n2 )
& ( ( sum @ n1 @ n2 )
= n3 )
& ( ( sum @ n1 @ n3 )
= n4 )
& ( ( sum @ n1 @ n4 )
= n5 )
& ( ( sum @ n1 @ n5 )
= n6 )
& ( ( sum @ n1 @ n6 )
= n7 )
& ( ( sum @ n1 @ n7 )
= n8 )
& ( ( sum @ n1 @ n8 )
= n9 )
& ( ( sum @ n1 @ n9 )
= n10 )
& ( ( sum @ n1 @ n10 )
= n0 )
& ( ( sum @ n2 @ n0 )
= n2 )
& ( ( sum @ n2 @ n1 )
= n3 )
& ( ( sum @ n2 @ n2 )
= n4 )
& ( ( sum @ n2 @ n3 )
= n5 )
& ( ( sum @ n2 @ n4 )
= n6 )
& ( ( sum @ n2 @ n5 )
= n7 )
& ( ( sum @ n2 @ n6 )
= n8 )
& ( ( sum @ n2 @ n7 )
= n9 )
& ( ( sum @ n2 @ n8 )
= n10 )
& ( ( sum @ n2 @ n9 )
= n0 )
& ( ( sum @ n2 @ n10 )
= n1 )
& ( ( sum @ n3 @ n0 )
= n3 )
& ( ( sum @ n3 @ n1 )
= n4 )
& ( ( sum @ n3 @ n2 )
= n5 )
& ( ( sum @ n3 @ n3 )
= n6 )
& ( ( sum @ n3 @ n4 )
= n7 )
& ( ( sum @ n3 @ n5 )
= n8 )
& ( ( sum @ n3 @ n6 )
= n9 )
& ( ( sum @ n3 @ n7 )
= n10 )
& ( ( sum @ n3 @ n8 )
= n0 )
& ( ( sum @ n3 @ n9 )
= n1 )
& ( ( sum @ n3 @ n10 )
= n2 )
& ( ( sum @ n4 @ n0 )
= n4 )
& ( ( sum @ n4 @ n1 )
= n5 )
& ( ( sum @ n4 @ n2 )
= n6 )
& ( ( sum @ n4 @ n3 )
= n7 )
& ( ( sum @ n4 @ n4 )
= n8 )
& ( ( sum @ n4 @ n5 )
= n9 )
& ( ( sum @ n4 @ n6 )
= n10 )
& ( ( sum @ n4 @ n7 )
= n0 )
& ( ( sum @ n4 @ n8 )
= n1 )
& ( ( sum @ n4 @ n9 )
= n2 )
& ( ( sum @ n4 @ n10 )
= n3 )
& ( ( sum @ n5 @ n0 )
= n5 )
& ( ( sum @ n5 @ n1 )
= n6 )
& ( ( sum @ n5 @ n2 )
= n7 )
& ( ( sum @ n5 @ n3 )
= n8 )
& ( ( sum @ n5 @ n4 )
= n9 )
& ( ( sum @ n5 @ n5 )
= n10 )
& ( ( sum @ n5 @ n6 )
= n0 )
& ( ( sum @ n5 @ n7 )
= n1 )
& ( ( sum @ n5 @ n8 )
= n2 )
& ( ( sum @ n5 @ n9 )
= n3 )
& ( ( sum @ n5 @ n10 )
= n4 )
& ( ( sum @ n6 @ n0 )
= n6 )
& ( ( sum @ n6 @ n1 )
= n7 )
& ( ( sum @ n6 @ n2 )
= n8 )
& ( ( sum @ n6 @ n3 )
= n9 )
& ( ( sum @ n6 @ n4 )
= n10 )
& ( ( sum @ n6 @ n5 )
= n0 )
& ( ( sum @ n6 @ n6 )
= n1 )
& ( ( sum @ n6 @ n7 )
= n2 )
& ( ( sum @ n6 @ n8 )
= n3 )
& ( ( sum @ n6 @ n9 )
= n4 )
& ( ( sum @ n6 @ n10 )
= n5 )
& ( ( sum @ n7 @ n0 )
= n7 )
& ( ( sum @ n7 @ n1 )
= n8 )
& ( ( sum @ n7 @ n2 )
= n9 )
& ( ( sum @ n7 @ n3 )
= n10 )
& ( ( sum @ n7 @ n4 )
= n0 )
& ( ( sum @ n7 @ n5 )
= n1 )
& ( ( sum @ n7 @ n6 )
= n2 )
& ( ( sum @ n7 @ n7 )
= n3 )
& ( ( sum @ n7 @ n8 )
= n4 )
& ( ( sum @ n7 @ n9 )
= n5 )
& ( ( sum @ n7 @ n10 )
= n6 )
& ( ( sum @ n8 @ n0 )
= n8 )
& ( ( sum @ n8 @ n1 )
= n9 )
& ( ( sum @ n8 @ n2 )
= n10 )
& ( ( sum @ n8 @ n3 )
= n0 )
& ( ( sum @ n8 @ n4 )
= n1 )
& ( ( sum @ n8 @ n5 )
= n2 )
& ( ( sum @ n8 @ n6 )
= n3 )
& ( ( sum @ n8 @ n7 )
= n4 )
& ( ( sum @ n8 @ n8 )
= n5 )
& ( ( sum @ n8 @ n9 )
= n6 )
& ( ( sum @ n8 @ n10 )
= n7 )
& ( ( sum @ n9 @ n0 )
= n9 )
& ( ( sum @ n9 @ n1 )
= n10 )
& ( ( sum @ n9 @ n2 )
= n0 )
& ( ( sum @ n9 @ n3 )
= n1 )
& ( ( sum @ n9 @ n4 )
= n2 )
& ( ( sum @ n9 @ n5 )
= n3 )
& ( ( sum @ n9 @ n6 )
= n4 )
& ( ( sum @ n9 @ n7 )
= n5 )
& ( ( sum @ n9 @ n8 )
= n6 )
& ( ( sum @ n9 @ n9 )
= n7 )
& ( ( sum @ n9 @ n10 )
= n8 )
& ( ( sum @ n10 @ n0 )
= n10 )
& ( ( sum @ n10 @ n1 )
= n0 )
& ( ( sum @ n10 @ n2 )
= n1 )
& ( ( sum @ n10 @ n3 )
= n2 )
& ( ( sum @ n10 @ n4 )
= n3 )
& ( ( sum @ n10 @ n5 )
= n4 )
& ( ( sum @ n10 @ n6 )
= n5 )
& ( ( sum @ n10 @ n7 )
= n6 )
& ( ( sum @ n10 @ n8 )
= n7 )
& ( ( sum @ n10 @ n9 )
= n8 )
& ( ( sum @ n10 @ n10 )
= n9 )
& ( ( A = n0 )
| ( A = n1 )
| ( A = n2 )
| ( A = n3 )
| ( A = n4 )
| ( A = n5 )
| ( A = n6 )
| ( A = n7 )
| ( A = n8 )
| ( A = n9 )
| ( A = n10 ) )
& ( ( B = n0 )
| ( B = n1 )
| ( B = n2 )
| ( B = n3 )
| ( B = n4 )
| ( B = n5 )
| ( B = n6 )
| ( B = n7 )
| ( B = n8 )
| ( B = n9 )
| ( B = n10 ) )
& ( ( sum @ ( sum @ ( pred @ A ) @ ( succ @ B ) ) @ ( sum @ ( pred @ B ) @ ( succ @ A ) ) )
!= ( sum @ ( sum @ ( pred @ A ) @ ( succ @ A ) ) @ ( sum @ ( pred @ B ) @ ( succ @ B ) ) ) )
& ( n0 != n1 )
& ( n0 != n2 )
& ( n0 != n3 )
& ( n0 != n4 )
& ( n0 != n5 )
& ( n0 != n6 )
& ( n0 != n7 )
& ( n0 != n8 )
& ( n0 != n9 )
& ( n0 != n10 )
& ( n1 != n2 )
& ( n1 != n3 )
& ( n1 != n4 )
& ( n1 != n5 )
& ( n1 != n6 )
& ( n1 != n7 )
& ( n1 != n8 )
& ( n1 != n9 )
& ( n1 != n10 )
& ( n2 != n3 )
& ( n2 != n4 )
& ( n2 != n5 )
& ( n2 != n6 )
& ( n2 != n7 )
& ( n2 != n8 )
& ( n2 != n9 )
& ( n2 != n10 )
& ( n3 != n4 )
& ( n3 != n5 )
& ( n3 != n6 )
& ( n3 != n7 )
& ( n3 != n8 )
& ( n3 != n9 )
& ( n3 != n10 )
& ( n4 != n5 )
& ( n4 != n6 )
& ( n4 != n7 )
& ( n4 != n8 )
& ( n4 != n9 )
& ( n4 != n10 )
& ( n5 != n6 )
& ( n5 != n7 )
& ( n5 != n8 )
& ( n5 != n9 )
& ( n5 != n10 )
& ( n6 != n7 )
& ( n6 != n8 )
& ( n6 != n9 )
& ( n6 != n10 )
& ( n7 != n8 )
& ( n7 != n9 )
& ( n7 != n10 )
& ( n8 != n9 )
& ( n8 != n10 )
& ( n9 != n10 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(406,plain,
$false,
inference(e,[status(thm)],[2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM376+1.010 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.15 % Command : run_Leo-III %s %d
% 0.16/0.35 % Computer : n001.cluster.edu
% 0.16/0.35 % Model : x86_64 x86_64
% 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35 % Memory : 8042.1875MB
% 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35 % CPULimit : 300
% 0.16/0.35 % WCLimit : 300
% 0.16/0.35 % DateTime : Thu May 18 17:35:21 EDT 2023
% 0.16/0.36 % CPUTime :
% 0.95/0.84 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.19/0.98 % [INFO] Parsing done (142ms).
% 1.19/0.99 % [INFO] Running in sequential loop mode.
% 1.76/1.20 % [INFO] eprover registered as external prover.
% 1.76/1.20 % [INFO] cvc4 registered as external prover.
% 1.76/1.20 % [INFO] Scanning for conjecture ...
% 1.95/1.25 % [INFO] 1 axioms and no conjecture found.
% 2.47/1.46 % [INFO] Problem is first-order (TPTP FOF).
% 2.47/1.47 % [INFO] Type checking passed.
% 2.47/1.47 % [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 ...
% 8.76/5.73 % External prover 'e' found a proof!
% 8.76/5.73 % [INFO] Killing All external provers ...
% 8.76/5.73 % Time passed: 5213ms (effective reasoning time: 4737ms)
% 8.76/5.73 % Axioms used in derivation (1): try_satisfy_this
% 8.76/5.73 % No. of inferences in proof: 3
% 8.76/5.73 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : 5213 ms resp. 4737 ms w/o parsing
% 9.18/5.78 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 9.18/5.78 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------