%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SEU931^5 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n017.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 : Wed Feb 25 09:37:46 AM UTC 2026
% Result : Theorem 1.48s 1.29s
% Output : Refutation 1.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 2
% Syntax : Number of formulae : 20 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 80 ( 63 equ; 0 cnn)
% Maximal formula atoms : 6 ( 4 avg)
% Number of connectives : 154 ( 18 ~; 9 |; 19 &; 92 @)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 56 ( 22 ^; 20 !; 14 ?; 56 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
f: $i > $i ).
thf(func_def_1,type,
g: $i > $i ).
thf(func_def_9,type,
ph2:
!>[X0: $tType] : X0 ).
thf(f23,plain,
$false,
inference(subsumption_resolution,[status(thm)],[f22,f15]) ).
thf(f15,plain,
! [X0: $i] :
( ( f @ X0 )
!= X0 ),
inference(cnf_transformation,[status(thm)],[f11]) ).
thf(f11,plain,
( ! [X0: $i] :
( ( f @ X0 )
!= X0 )
& ( ( ^ [Y0: $i] : ( f @ ( g @ Y0 ) ) )
= ( ^ [Y0: $i] : ( g @ ( f @ Y0 ) ) ) )
& ! [X2: $i] :
( ( sK0 = X2 )
| ( ( g @ X2 )
!= X2 ) )
& ( sK0
= ( g @ sK0 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f9,f10]) ).
thf(f10,plain,
( ? [X1: $i] :
( ! [X2: $i] :
( ( X1 = X2 )
| ( ( g @ X2 )
!= X2 ) )
& ( ( g @ X1 )
= X1 ) )
=> ( ! [X2: $i] :
( ( sK0 = X2 )
| ( ( g @ X2 )
!= X2 ) )
& ( sK0
= ( g @ sK0 ) ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f9,plain,
( ! [X0: $i] :
( ( f @ X0 )
!= X0 )
& ( ( ^ [Y0: $i] : ( f @ ( g @ Y0 ) ) )
= ( ^ [Y0: $i] : ( g @ ( f @ Y0 ) ) ) )
& ? [X1: $i] :
( ! [X2: $i] :
( ( X1 = X2 )
| ( ( g @ X2 )
!= X2 ) )
& ( ( g @ X1 )
= X1 ) ) ),
inference(rectify,[status(thm)],[f8]) ).
thf(f8,plain,
( ! [X2: $i] :
( ( f @ X2 )
!= X2 )
& ( ( ^ [Y0: $i] : ( f @ ( g @ Y0 ) ) )
= ( ^ [Y0: $i] : ( g @ ( f @ Y0 ) ) ) )
& ? [X0: $i] :
( ! [X1: $i] :
( ( X0 = X1 )
| ( ( g @ X1 )
!= X1 ) )
& ( ( g @ X0 )
= X0 ) ) ),
inference(flattening,[status(thm)],[f7]) ).
thf(f7,plain,
( ! [X2: $i] :
( ( f @ X2 )
!= X2 )
& ? [X0: $i] :
( ! [X1: $i] :
( ( X0 = X1 )
| ( ( g @ X1 )
!= X1 ) )
& ( ( g @ X0 )
= X0 ) )
& ( ( ^ [Y0: $i] : ( f @ ( g @ Y0 ) ) )
= ( ^ [Y0: $i] : ( g @ ( f @ Y0 ) ) ) ) ),
inference(ennf_transformation,[status(thm)],[f6]) ).
thf(f6,plain,
~ ( ( ( ^ [Y0: $i] : ( f @ ( g @ Y0 ) ) )
= ( ^ [Y0: $i] : ( g @ ( f @ Y0 ) ) ) )
=> ( ? [X0: $i] :
( ( ( g @ X0 )
= X0 )
& ! [X1: $i] :
( ( ( g @ X1 )
= X1 )
=> ( X0 = X1 ) ) )
=> ? [X2: $i] :
( ( f @ X2 )
= X2 ) ) ),
inference(rectify,[status(thm)],[f5]) ).
thf(f5,plain,
~ ( ( ( ^ [Y0: $i] : ( f @ ( g @ Y0 ) ) )
= ( ^ [Y0: $i] : ( g @ ( f @ Y0 ) ) ) )
=> ( ? [X2: $i] :
( ( ( g @ X2 )
= X2 )
& ! [X3: $i] :
( ( ( g @ X3 )
= X3 )
=> ( X2 = X3 ) ) )
=> ? [X4: $i] :
( ( f @ X4 )
= X4 ) ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ( ( ( ^ [X0: $i] : ( g @ ( f @ X0 ) ) )
= ( ^ [X1: $i] : ( f @ ( g @ X1 ) ) ) )
=> ( ? [X2: $i] :
( ( ( g @ X2 )
= X2 )
& ! [X3: $i] :
( ( ( g @ X3 )
= X3 )
=> ( X2 = X3 ) ) )
=> ? [X4: $i] :
( ( f @ X4 )
= X4 ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ( ( ( ^ [X0: $i] : ( g @ ( f @ X0 ) ) )
= ( ^ [X0: $i] : ( f @ ( g @ X0 ) ) ) )
=> ( ? [X0: $i] :
( ( ( g @ X0 )
= X0 )
& ! [X1: $i] :
( ( ( g @ X1 )
= X1 )
=> ( X0 = X1 ) ) )
=> ? [X2: $i] :
( ( f @ X2 )
= X2 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
( ( ( ^ [X0: $i] : ( g @ ( f @ X0 ) ) )
= ( ^ [X0: $i] : ( f @ ( g @ X0 ) ) ) )
=> ( ? [X0: $i] :
( ( ( g @ X0 )
= X0 )
& ! [X1: $i] :
( ( ( g @ X1 )
= X1 )
=> ( X0 = X1 ) ) )
=> ? [X2: $i] :
( ( f @ X2 )
= X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ydUpwjKXv2/DTF2THF_12135.p',cTHM171_pme) ).
thf(f22,plain,
( sK0
= ( f @ sK0 ) ),
inference(trivial_inequality_removal,[status(thm)],[f20]) ).
thf(f20,plain,
( ( ( f @ sK0 )
!= ( f @ sK0 ) )
| ( sK0
= ( f @ sK0 ) ) ),
inference(superposition,[status(thm)],[f19,f12]) ).
thf(f12,plain,
( sK0
= ( g @ sK0 ) ),
inference(cnf_transformation,[status(thm)],[f11]) ).
thf(f19,plain,
! [X0: $i] :
( ( ( f @ ( g @ X0 ) )
!= ( f @ X0 ) )
| ( ( f @ X0 )
= sK0 ) ),
inference(superposition,[status(thm)],[f13,f18]) ).
thf(f18,plain,
! [X1: $i] :
( ( g @ ( f @ X1 ) )
= ( f @ ( g @ X1 ) ) ),
inference(beta_eta_normalization,[status(thm)],[f17]) ).
thf(f17,plain,
! [X1: $i] :
( ( ^ [Y0: $i] : ( g @ ( f @ Y0 ) )
@ X1 )
= ( ^ [Y0: $i] : ( f @ ( g @ Y0 ) )
@ X1 ) ),
inference(argument_congruence,[status(thm)],[f14]) ).
thf(f14,plain,
( ( ^ [Y0: $i] : ( f @ ( g @ Y0 ) ) )
= ( ^ [Y0: $i] : ( g @ ( f @ Y0 ) ) ) ),
inference(cnf_transformation,[status(thm)],[f11]) ).
thf(f13,plain,
! [X2: $i] :
( ( ( g @ X2 )
!= X2 )
| ( sK0 = X2 ) ),
inference(cnf_transformation,[status(thm)],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU931^5 : TPTP v9.2.1. Released v4.0.0.
% 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.16/0.33 % Computer : n017.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue Feb 24 12:35:56 EST 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.34 Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.18/0.45 ---- Original DTF file ---
% 0.18/0.45 thf(spec,logic,$$dhol).
% 0.18/0.45 %------------------------------------------------------------------------------
% 0.18/0.45 % File : SEU931^5 : TPTP v9.2.1. Released v4.0.0.
% 0.18/0.45 % Domain : Set Theory (Functions)
% 0.18/0.45 % Problem : TPS problem THM171
% 0.18/0.45 % Version : Especial.
% 0.18/0.45 % English : If g commutes with f, and g has a unique fixed point, then f has
% 0.18/0.45 % a fixed point.
% 0.18/0.45
% 0.18/0.45 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.18/0.45 % Source : [Bro09]
% 0.18/0.45 % Names : tps_0259 [Bro09]
% 0.18/0.45 % : THM171 [TPS]
% 0.18/0.45
% 0.18/0.45 % Status : Theorem
% 0.18/0.45 % Rating : 0.00 v8.2.0, 0.08 v8.1.0, 0.00 v7.4.0, 0.11 v7.2.0, 0.00 v7.1.0, 0.12 v7.0.0, 0.14 v6.4.0, 0.17 v6.3.0, 0.20 v6.2.0, 0.14 v5.5.0, 0.17 v5.4.0, 0.20 v5.3.0, 0.40 v5.2.0, 0.20 v4.1.0, 0.00 v4.0.1, 0.33 v4.0.0
% 0.18/0.45 % Syntax : Number of formulae : 3 ( 0 unt; 2 typ; 0 def)
% 0.18/0.45 % Number of atoms : 5 ( 5 equ; 0 cnn)
% 0.18/0.45 % Maximal formula atoms : 5 ( 5 avg)
% 0.18/0.45 % Number of connectives : 11 ( 0 ~; 0 |; 1 &; 7 @)
% 0.18/0.45 % ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% 0.18/0.45 % Maximal formula depth : 7 ( 7 avg)
% 0.18/0.45 % Number of types : 1 ( 0 usr)
% 0.18/0.45 % Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% 0.18/0.45 % Number of symbols : 3 ( 2 usr; 0 con; 1-2 aty)
% 0.18/0.45 % Number of variables : 5 ( 2 ^; 1 !; 2 ?; 5 :)
% 0.18/0.45 % SPC : TH0_THM_EQU_NAR
% 0.18/0.45
% 0.18/0.45 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.18/0.45 % project in the Department of Mathematical Sciences at Carnegie
% 0.18/0.45 % Mellon University. Distributed under the Creative Commons copyleft
% 0.18/0.45 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.18/0.45 % : Polymorphic definitions expanded.
% 0.18/0.45 %------------------------------------------------------------------------------
% 0.18/0.45 thf(f,type,
% 0.18/0.45 f: $i > $i ).
% 0.18/0.45
% 0.18/0.45 thf(g,type,
% 0.18/0.45 g: $i > $i ).
% 0.18/0.45
% 0.18/0.45 thf(cTHM171_pme,conjecture,
% 0.18/0.45 ( ( ( ^ [Xx: $i] : ( f @ ( g @ Xx ) ) )
% 0.18/0.45 = ( ^ [Xx: $i] : ( g @ ( f @ Xx ) ) ) )
% 0.18/0.45 => ( ? [Xx: $i] :
% 0.18/0.45 ( ( ( g @ Xx )
% 0.18/0.45 = Xx )
% 0.18/0.45 & ! [Xz: $i] :
% 0.18/0.45 ( ( ( g @ Xz )
% 0.18/0.45 = Xz )
% 0.18/0.45 => ( Xz = Xx ) ) )
% 0.18/0.45 => ? [Xy: $i] :
% 0.18/0.45 ( ( f @ Xy )
% 0.18/0.45 = Xy ) ) ) ).
% 0.18/0.45
% 0.18/0.45 %------------------------------------------------------------------------------
% 0.18/0.45 ------------------------
% 1.48/1.27 ---- Embedded in THF ---
% 1.48/1.27 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.48/1.27 %%% Generated on Tue Feb 24 12:35:57 EST 2026
% 1.48/1.27 %%% using '$$dhol' embedding, version 1.3.0.
% 1.48/1.27 %%% Logic specification used:
% 1.48/1.27 %%% thf(spec, logic, $$dhol).
% 1.48/1.27
% 1.48/1.27 % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.ydUpwjKXv2/DTF2DTF12135.p
% See solution above
% 1.48/1.27 ------------------------
% 1.48/1.28 ---- Cleaned THF ---
% 1.48/1.28 thf(f,type,
% 1.48/1.28 f: $i > $i ).
% 1.48/1.28
% 1.48/1.28 thf(g,type,
% 1.48/1.28 g: $i > $i ).
% 1.48/1.28
% 1.48/1.28 thf(cTHM171_pme,conjecture,
% 1.48/1.28 ( ( ( ^ [Xx: $i] : ( f @ ( g @ Xx ) ) )
% 1.48/1.28 = ( ^ [Xx: $i] : ( g @ ( f @ Xx ) ) ) )
% 1.48/1.28 => ( ? [Xx: $i] :
% 1.48/1.28 ( ( ( g @ Xx )
% 1.48/1.28 = Xx )
% 1.48/1.28 & ! [Xz: $i] :
% 1.48/1.28 ( ( ( g @ Xz )
% 1.48/1.28 = Xz )
% 1.48/1.28 => ( Xz = Xx ) ) )
% 1.48/1.28 => ? [Xy: $i] :
% 1.48/1.28 ( ( f @ Xy )
% 1.48/1.28 = Xy ) ) ) ).
% 1.48/1.28 ------------------------
% 1.48/1.29 % (12308)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_12135 for (3000ds/183Mi)
% 1.48/1.29 % (12308)First to succeed.
% 1.48/1.29 % (12308)Refutation found. Thanks to Tanya!
% 1.48/1.29 % SZS status Theorem for DTF2THF_12135
% 1.48/1.29 % SZS output start Proof for DTF2THF_12135
% 1.48/1.29 thf(func_def_0, type, f: $i > $i).
% 1.48/1.29 thf(func_def_1, type, g: $i > $i).
% 1.48/1.29 thf(func_def_9, type, ph2: !>[X0: $tType]:(X0)).
% 1.48/1.29 thf(f23,plain,(
% 1.48/1.29 $false),
% 1.48/1.29 inference(subsumption_resolution,[status(thm)],[f22,f15])).
% 1.48/1.29 thf(f15,plain,(
% 1.48/1.29 ( ! [X0 : $i] : (((f @ X0) != X0)) )),
% 1.48/1.29 inference(cnf_transformation,[status(thm)],[f11])).
% 1.48/1.29 thf(f11,plain,(
% 1.48/1.29 ! [X0 : $i] : ((f @ X0) != X0) & ((^[Y0 : $i]: (f @ (g @ Y0))) = (^[Y0 : $i]: (g @ (f @ Y0)))) & (! [X2 : $i] : ((sK0 = X2) | ((g @ X2) != X2)) & (sK0 = (g @ sK0)))),
% 1.48/1.29 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f9,f10])).
% 1.48/1.29 thf(f10,plain,(
% 1.48/1.29 ? [X1 : $i] : (! [X2 : $i] : ((X1 = X2) | ((g @ X2) != X2)) & ((g @ X1) = X1)) => (! [X2 : $i] : ((sK0 = X2) | ((g @ X2) != X2)) & (sK0 = (g @ sK0)))),
% 1.48/1.29 introduced(definition,[],[choice_axiom])).
% 1.48/1.29 thf(f9,plain,(
% 1.48/1.29 ! [X0 : $i] : ((f @ X0) != X0) & ((^[Y0 : $i]: (f @ (g @ Y0))) = (^[Y0 : $i]: (g @ (f @ Y0)))) & ? [X1 : $i] : (! [X2 : $i] : ((X1 = X2) | ((g @ X2) != X2)) & ((g @ X1) = X1))),
% 1.48/1.29 inference(rectify,[status(thm)],[f8])).
% 1.48/1.29 thf(f8,plain,(
% 1.48/1.29 ! [X2 : $i] : ((f @ X2) != X2) & ((^[Y0 : $i]: (f @ (g @ Y0))) = (^[Y0 : $i]: (g @ (f @ Y0)))) & ? [X0 : $i] : (! [X1 : $i] : ((X0 = X1) | ((g @ X1) != X1)) & ((g @ X0) = X0))),
% 1.48/1.29 inference(flattening,[status(thm)],[f7])).
% 1.48/1.29 thf(f7,plain,(
% 1.48/1.29 (! [X2 : $i] : ((f @ X2) != X2) & ? [X0 : $i] : (! [X1 : $i] : ((X0 = X1) | ((g @ X1) != X1)) & ((g @ X0) = X0))) & ((^[Y0 : $i]: (f @ (g @ Y0))) = (^[Y0 : $i]: (g @ (f @ Y0))))),
% 1.48/1.29 inference(ennf_transformation,[status(thm)],[f6])).
% 1.48/1.29 thf(f6,plain,(
% 1.48/1.29 ~(((^[Y0 : $i]: (f @ (g @ Y0))) = (^[Y0 : $i]: (g @ (f @ Y0)))) => (? [X0 : $i] : (((g @ X0) = X0) & ! [X1 : $i] : (((g @ X1) = X1) => (X0 = X1))) => ? [X2 : $i] : ((f @ X2) = X2)))),
% 1.48/1.29 inference(rectify,[status(thm)],[f5])).
% 1.48/1.29 thf(f5,plain,(
% 1.48/1.29 ~(((^[Y0 : $i]: (f @ (g @ Y0))) = (^[Y0 : $i]: (g @ (f @ Y0)))) => (? [X2 : $i] : (((g @ X2) = X2) & ! [X3 : $i] : (((g @ X3) = X3) => (X2 = X3))) => ? [X4 : $i] : ((f @ X4) = X4)))),
% 1.48/1.29 inference(fool_elimination,[status(thm)],[f4])).
% 1.48/1.29 thf(f4,plain,(
% 1.48/1.29 ~(((^[X0 : $i] : (g @ (f @ X0))) = (^[X1 : $i] : (f @ (g @ X1)))) => (? [X2 : $i] : (((g @ X2) = X2) & ! [X3 : $i] : (((g @ X3) = X3) => (X2 = X3))) => ? [X4 : $i] : ((f @ X4) = X4)))),
% 1.48/1.29 inference(rectify,[status(thm)],[f2])).
% 1.48/1.29 thf(f2,negated_conjecture,(
% 1.48/1.29 ~(((^[X0 : $i] : (g @ (f @ X0))) = (^[X0 : $i] : (f @ (g @ X0)))) => (? [X0 : $i] : (((g @ X0) = X0) & ! [X1 : $i] : (((g @ X1) = X1) => (X0 = X1))) => ? [X2 : $i] : ((f @ X2) = X2)))),
% 1.48/1.29 inference(negated_conjecture,[status(cth)],[f1])).
% 1.48/1.29 thf(f1,conjecture,(
% 1.48/1.29 ((^[X0 : $i] : (g @ (f @ X0))) = (^[X0 : $i] : (f @ (g @ X0)))) => (? [X0 : $i] : (((g @ X0) = X0) & ! [X1 : $i] : (((g @ X1) = X1) => (X0 = X1))) => ? [X2 : $i] : ((f @ X2) = X2))),
% 1.48/1.29 file('/export/starexec/sandbox2/tmp/tmp.ydUpwjKXv2/DTF2THF_12135.p',cTHM171_pme)).
% 1.48/1.29 thf(f22,plain,(
% 1.48/1.29 (sK0 = (f @ sK0))),
% 1.48/1.29 inference(trivial_inequality_removal,[status(thm)],[f20])).
% 1.48/1.29 thf(f20,plain,(
% 1.48/1.29 ((f @ sK0) != (f @ sK0)) | (sK0 = (f @ sK0))),
% 1.48/1.29 inference(superposition,[status(thm)],[f19,f12])).
% 1.48/1.29 thf(f12,plain,(
% 1.48/1.29 (sK0 = (g @ sK0))),
% 1.48/1.29 inference(cnf_transformation,[status(thm)],[f11])).
% 1.48/1.29 thf(f19,plain,(
% 1.48/1.29 ( ! [X0 : $i] : (((f @ (g @ X0)) != (f @ X0)) | ((f @ X0) = sK0)) )),
% 1.48/1.29 inference(superposition,[status(thm)],[f13,f18])).
% 1.48/1.29 thf(f18,plain,(
% 1.48/1.29 ( ! [X1 : $i] : (((g @ (f @ X1)) = (f @ (g @ X1)))) )),
% 1.48/1.29 inference(beta_eta_normalization,[status(thm)],[f17])).
% 1.48/1.29 thf(f17,plain,(
% 1.48/1.29 ( ! [X1 : $i] : ((((^[Y0 : $i]: (g @ (f @ Y0))) @ X1) = ((^[Y0 : $i]: (f @ (g @ Y0))) @ X1))) )),
% 1.48/1.29 inference(argument_congruence,[status(thm)],[f14])).
% 1.48/1.29 thf(f14,plain,(
% 1.48/1.29 ((^[Y0 : $i]: (f @ (g @ Y0))) = (^[Y0 : $i]: (g @ (f @ Y0))))),
% 1.48/1.29 inference(cnf_transformation,[status(thm)],[f11])).
% 1.48/1.29 thf(f13,plain,(
% 1.48/1.29 ( ! [X2 : $i] : (((g @ X2) != X2) | (sK0 = X2)) )),
% 1.48/1.29 inference(cnf_transformation,[status(thm)],[f11])).
% 1.48/1.29 % SZS output end Proof for DTF2THF_12135
% 1.48/1.29 % (12308)------------------------------
% 1.48/1.29 % (12308)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.48/1.29 % (12308)Termination reason: Refutation
% 1.48/1.29
% 1.48/1.29 % (12308)Memory used [KB]: 5500
% 1.48/1.29 % (12308)Time elapsed: 0.003 s
% 1.48/1.29 % (12308)Instructions burned: 1 (million)
% 1.48/1.29 % (12308)------------------------------
% 1.48/1.29 % (12308)------------------------------
% 1.48/1.29 % (12307)Success in time 0.013 s
%------------------------------------------------------------------------------