↑ Up

DT2H2X---1.9.5.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : DT2H2X---1.9.5
% Problem  : SYO028^1 : TPTP v9.2.1. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300

% Computer : n012.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:53:10 AM UTC 2026

% Result   : Theorem 1.39s 1.27s
% Output   : Refutation 1.39s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    8 (   5 unt;   0 typ;   0 def)
%            Number of atoms       :   10 (   4 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    8 (   8   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :   11 (   5 fml;   6 var)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   0 usr;   2 prp; 0-2 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    6 (   6   !;   0   ?;   6   :)

% Comments : 
%------------------------------------------------------------------------------
tff(f8,plain,
    $false,
    inference(subsumption_resolution,[status(thm)],[f3,f7]) ).

tff(f7,plain,
    ! [X0: $o] : ( $true = (X0) ),
    inference(cnf_transformation,[status(thm)],[f6]) ).

tff(f6,plain,
    ! [X0: $o] : ( $true = (X0) ),
    inference(flattening,[status(thm)],[f5]) ).

tff(f5,plain,
    ~ ~ ! [X0: $o] : ( $true = (X0) ),
    inference(fool_elimination,[status(thm)],[f4]) ).

tff(f4,plain,
    ~ ~ ! [X0: $o] : (X0),
    inference(rectify,[status(thm)],[f2]) ).

tff(f2,negated_conjecture,
    ~ ~ ! [X0: $o] : (X0),
    inference(negated_conjecture,[status(cth)],[f1]) ).

tff(f1,conjecture,
    ~ ! [X0: $o] : (X0),
    file('/export/starexec/sandbox/tmp/tmp.SOiuQN5bEF/DTF2THF_32536.p',conj) ).

tff(f3,plain,
    $false != $true,
    introduced(definition,[],[fool_axiom]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06  % Problem  : SYO028^1 : TPTP v9.2.1. Released v3.7.0.
% 0.00/0.07  % Command  : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.07/0.25  % Computer : n012.cluster.edu
% 0.07/0.25  % Model    : x86_64 x86_64
% 0.07/0.25  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.25  % Memory   : 8042.1875MB
% 0.07/0.25  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.07/0.25  % CPULimit : 300
% 0.07/0.25  % WCLimit  : 300
% 0.07/0.25  % DateTime : Tue Feb 24 14:21:30 EST 2026
% 0.07/0.25  % CPUTime  : 
% 0.07/0.25  Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.07/0.34  ---- Original DTF file ---
% 0.07/0.34  thf(spec,logic,$$dhol).
% 0.07/0.34  %------------------------------------------------------------------------------
% 0.07/0.34  % File     : SYO028^1 : TPTP v9.2.1. Released v3.7.0.
% 0.07/0.34  % Domain   : Syntactic
% 0.07/0.34  % Problem  : Not all things are false
% 0.07/0.34  % Version  : Especial.
% 0.07/0.34  % English  :
% 0.07/0.34  
% 0.07/0.34  % Refs     : [BB05]  Benzmueller & Brown (2005), A Structured Set of Higher
% 0.07/0.34  %          : [Ben09] Benzmueller (2009), Email to Geoff Sutcliffe
% 0.07/0.34  % Source   : [Ben09]
% 0.07/0.34  % Names    : Example 24 [BB05]
% 0.07/0.34  
% 0.07/0.34  % Status   : Theorem
% 0.07/0.34  % Rating   : 0.08 v9.1.0, 0.00 v9.0.0, 0.08 v8.2.0, 0.09 v8.1.0, 0.00 v6.2.0, 0.33 v6.1.0, 0.00 v3.7.0
% 0.07/0.34  % Syntax   : Number of formulae    :    1 (   0 unt;   0 typ;   0 def)
% 0.07/0.34  %            Number of atoms       :    0 (   0 equ;   0 cnn)
% 0.07/0.34  %            Maximal formula atoms :    0 (   0 avg)
% 0.07/0.34  %            Number of connectives :    1 (   1   ~;   0   |;   0   &;   0   @)
% 0.07/0.34  %                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
% 0.07/0.34  %            Maximal formula depth :    3 (   3 avg)
% 0.07/0.34  %            Number of types       :    1 (   0 usr)
% 0.07/0.34  %            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
% 0.07/0.34  %            Number of symbols     :    0 (   0 usr;   0 con; --- aty)
% 0.07/0.34  %            Number of variables   :    1 (   0   ^;   1   !;   0   ?;   1   :)
% 0.07/0.34  % SPC      : TH0_THM_NEQ_NAR
% 0.07/0.34  
% 0.07/0.34  % Comments : 
% 0.07/0.34  %------------------------------------------------------------------------------
% 0.07/0.34  thf(conj,conjecture,
% 0.07/0.34      ~ ! [P: $o] : P ).
% 0.07/0.34  
% 0.07/0.34  %------------------------------------------------------------------------------
% 0.07/0.34  ------------------------
% 1.39/1.23  ---- Embedded in THF ---
% 1.39/1.24  %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.39/1.24  %%% Generated on Tue Feb 24 14:21:31 EST 2026
% 1.39/1.24  %%% using '$$dhol' embedding, version 1.3.0.
% 1.39/1.24  %%% Logic specification used:
% 1.39/1.24  %%% thf(spec, logic, $$dhol).
% 1.39/1.24  
% 1.39/1.24  % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.SOiuQN5bEF/DTF2DTF32536.p
% See solution above
% 1.39/1.24  ------------------------
% 1.39/1.24  ---- Cleaned THF ---
% 1.39/1.24  thf(conj,conjecture,
% 1.39/1.24      ~ ! [P: $o] : P ).
% 1.39/1.24  ------------------------
% 1.39/1.26  % (32634)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on DTF2THF_32536 for (3000ds/4Mi)
% 1.39/1.26  % (32635)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on DTF2THF_32536 for (3000ds/27Mi)
% 1.39/1.26  % (32633)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_32536 for (3000ds/183Mi)
% 1.39/1.26  % (32636)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_32536 for (3000ds/2Mi)
% 1.39/1.26  % (32639)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_32536 for (3000ds/18Mi)
% 1.39/1.26  % (32638)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on DTF2THF_32536 for (3000ds/275Mi)
% 1.39/1.26  % (32637)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on DTF2THF_32536 for (3000ds/2Mi)
% 1.39/1.26  % (32634)First to succeed.
% 1.39/1.26  % (32638)Refutation not found, incomplete strategy
% 1.39/1.26  % (32638)------------------------------
% 1.39/1.26  % (32638)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.39/1.26  % (32638)Termination reason: Refutation not found, incomplete strategy
% 1.39/1.26  
% 1.39/1.26  
% 1.39/1.26  % (32638)Memory used [KB]: 5373
% 1.39/1.26  % (32638)Time elapsed: 0.002 s
% 1.39/1.26  % (32638)Instructions burned: 1 (million)
% 1.39/1.26  % (32638)------------------------------
% 1.39/1.26  % (32638)------------------------------
% 1.39/1.26  % (32636)Also succeeded, but the first one will report.
% 1.39/1.26  % (32633)Also succeeded, but the first one will report.
% 1.39/1.27  % (32634)Refutation found. Thanks to Tanya!
% 1.39/1.27  % SZS status Theorem for DTF2THF_32536
% 1.39/1.27  % SZS output start Proof for DTF2THF_32536
% 1.39/1.27  tff(f8,plain,(
% 1.39/1.27    $false),
% 1.39/1.27    inference(subsumption_resolution,[status(thm)],[f3,f7])).
% 1.39/1.27  tff(f7,plain,(
% 1.39/1.27    ( ! [X0 : $o] : (($true = X0)) )),
% 1.39/1.27    inference(cnf_transformation,[status(thm)],[f6])).
% 1.39/1.27  tff(f6,plain,(
% 1.39/1.27    ! [X0 : $o] : ($true = X0)),
% 1.39/1.27    inference(flattening,[status(thm)],[f5])).
% 1.39/1.27  tff(f5,plain,(
% 1.39/1.27    ~~! [X0 : $o] : ($true = X0)),
% 1.39/1.27    inference(fool_elimination,[status(thm)],[f4])).
% 1.39/1.27  tff(f4,plain,(
% 1.39/1.27    ~~! [X0 : $o] : X0),
% 1.39/1.27    inference(rectify,[status(thm)],[f2])).
% 1.39/1.27  tff(f2,negated_conjecture,(
% 1.39/1.27    ~~! [X0 : $o] : X0),
% 1.39/1.27    inference(negated_conjecture,[status(cth)],[f1])).
% 1.39/1.27  tff(f1,conjecture,(
% 1.39/1.27    ~! [X0 : $o] : X0),
% 1.39/1.27    file('/export/starexec/sandbox/tmp/tmp.SOiuQN5bEF/DTF2THF_32536.p',conj)).
% 1.39/1.27  tff(f3,plain,(
% 1.39/1.27    ($false != $true)),
% 1.39/1.27    introduced(definition,[],[fool_axiom])).
% 1.39/1.27  % SZS output end Proof for DTF2THF_32536
% 1.39/1.27  % (32634)------------------------------
% 1.39/1.27  % (32634)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.39/1.27  % (32634)Termination reason: Refutation
% 1.39/1.27  
% 1.39/1.27  % (32634)Memory used [KB]: 5373
% 1.39/1.27  % (32634)Time elapsed: 0.002 s
% 1.39/1.27  % (32634)Instructions burned: 1 (million)
% 1.39/1.27  % (32634)------------------------------
% 1.39/1.27  % (32634)------------------------------
% 1.39/1.27  % (32632)Success in time 0.006 s
%------------------------------------------------------------------------------