TSTP Solution File: NUM291+1 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : NUM291+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : NO INFORMATION
% Format : NO INFORMATION
% Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.OIHdiGfxce true
% Computer : n013.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 : Thu Aug 31 12:39:46 EDT 2023
% Result : Theorem 1.66s 0.81s
% Output : Refutation 1.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 13
% Syntax : Number of formulae : 25 ( 12 unt; 7 typ; 0 def)
% Number of atoms : 30 ( 1 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 103 ( 13 ~; 7 |; 3 &; 78 @)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 15 ( 0 ^; 15 !; 0 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
thf(rdnn_type,type,
rdnn: $i > $i ).
thf(rdn_pos_type,type,
rdn_pos: $i > $i ).
thf(n2_type,type,
n2: $i ).
thf(rdn_translate_type,type,
rdn_translate: $i > $i > $o ).
thf(rdn_positive_less_type,type,
rdn_positive_less: $i > $i > $o ).
thf(n3_type,type,
n3: $i ).
thf(less_type,type,
less: $i > $i > $o ).
thf(rdn_positive_less23,axiom,
rdn_positive_less @ ( rdnn @ n2 ) @ ( rdnn @ n3 ) ).
thf(zip_derived_cl12,plain,
rdn_positive_less @ ( rdnn @ n2 ) @ ( rdnn @ n3 ),
inference(cnf,[status(esa)],[rdn_positive_less23]) ).
thf(rdn2,axiom,
rdn_translate @ n2 @ ( rdn_pos @ ( rdnn @ n2 ) ) ).
thf(zip_derived_cl2,plain,
rdn_translate @ n2 @ ( rdn_pos @ ( rdnn @ n2 ) ),
inference(cnf,[status(esa)],[rdn2]) ).
thf(less_entry_point_pos_pos,axiom,
! [X: $i,Y: $i,RDN_X: $i,RDN_Y: $i] :
( ( ( rdn_translate @ X @ ( rdn_pos @ RDN_X ) )
& ( rdn_translate @ Y @ ( rdn_pos @ RDN_Y ) )
& ( rdn_positive_less @ RDN_X @ RDN_Y ) )
=> ( less @ X @ Y ) ) ).
thf(zip_derived_cl23,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( less @ X0 @ X1 )
| ~ ( rdn_translate @ X0 @ ( rdn_pos @ X2 ) )
| ~ ( rdn_translate @ X1 @ ( rdn_pos @ X3 ) )
| ~ ( rdn_positive_less @ X2 @ X3 ) ),
inference(cnf,[status(esa)],[less_entry_point_pos_pos]) ).
thf(zip_derived_cl157,plain,
! [X0: $i,X1: $i] :
( ~ ( rdn_positive_less @ ( rdnn @ n2 ) @ X0 )
| ~ ( rdn_translate @ X1 @ ( rdn_pos @ X0 ) )
| ( less @ n2 @ X1 ) ),
inference('sup-',[status(thm)],[zip_derived_cl2,zip_derived_cl23]) ).
thf(zip_derived_cl192,plain,
! [X0: $i] :
( ( less @ n2 @ X0 )
| ~ ( rdn_translate @ X0 @ ( rdn_pos @ ( rdnn @ n3 ) ) ) ),
inference('sup-',[status(thm)],[zip_derived_cl12,zip_derived_cl157]) ).
thf(n3_not_less_n2,conjecture,
~ ( less @ n3 @ n2 ) ).
thf(zf_stmt_0,negated_conjecture,
less @ n3 @ n2,
inference('cnf.neg',[status(esa)],[n3_not_less_n2]) ).
thf(zip_derived_cl142,plain,
less @ n3 @ n2,
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(less_property,axiom,
! [X: $i,Y: $i] :
( ( less @ X @ Y )
<=> ( ~ ( less @ Y @ X )
& ( Y != X ) ) ) ).
thf(zip_derived_cl26,plain,
! [X0: $i,X1: $i] :
( ~ ( less @ X0 @ X1 )
| ~ ( less @ X1 @ X0 ) ),
inference(cnf,[status(esa)],[less_property]) ).
thf(zip_derived_cl145,plain,
~ ( less @ n2 @ n3 ),
inference('sup-',[status(thm)],[zip_derived_cl142,zip_derived_cl26]) ).
thf(zip_derived_cl228,plain,
~ ( rdn_translate @ n3 @ ( rdn_pos @ ( rdnn @ n3 ) ) ),
inference('sup-',[status(thm)],[zip_derived_cl192,zip_derived_cl145]) ).
thf(rdn3,axiom,
rdn_translate @ n3 @ ( rdn_pos @ ( rdnn @ n3 ) ) ).
thf(zip_derived_cl3,plain,
rdn_translate @ n3 @ ( rdn_pos @ ( rdnn @ n3 ) ),
inference(cnf,[status(esa)],[rdn3]) ).
thf(zip_derived_cl229,plain,
$false,
inference(demod,[status(thm)],[zip_derived_cl228,zip_derived_cl3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : NUM291+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.12 % Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.OIHdiGfxce true
% 0.16/0.33 % Computer : n013.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 : Fri Aug 25 09:09:02 EDT 2023
% 0.16/0.33 % CPUTime :
% 0.16/0.33 % Running portfolio for 300 s
% 0.16/0.33 % File : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.33 % Number of cores: 8
% 0.16/0.33 % Python version: Python 3.6.8
% 0.16/0.34 % Running in FO mode
% 0.19/0.62 % Total configuration time : 435
% 0.19/0.62 % Estimated wc time : 1092
% 0.19/0.62 % Estimated cpu time (7 cpus) : 156.0
% 0.19/0.70 % /export/starexec/sandbox2/solver/bin/fo/fo6_bce.sh running for 75s
% 0.19/0.72 % /export/starexec/sandbox2/solver/bin/fo/fo3_bce.sh running for 75s
% 0.19/0.72 % /export/starexec/sandbox2/solver/bin/fo/fo7.sh running for 63s
% 0.19/0.72 % /export/starexec/sandbox2/solver/bin/fo/fo4.sh running for 50s
% 0.19/0.72 % /export/starexec/sandbox2/solver/bin/fo/fo13.sh running for 50s
% 0.19/0.72 % /export/starexec/sandbox2/solver/bin/fo/fo5.sh running for 50s
% 0.19/0.72 % /export/starexec/sandbox2/solver/bin/fo/fo1_av.sh running for 75s
% 1.66/0.80 % /export/starexec/sandbox2/solver/bin/fo/fo1_lcnf.sh running for 50s
% 1.66/0.81 % Solved by fo/fo7.sh.
% 1.66/0.81 % done 78 iterations in 0.072s
% 1.66/0.81 % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 1.66/0.81 % SZS output start Refutation
% See solution above
% 1.66/0.81
% 1.66/0.81
% 1.66/0.81 % Terminating...
% 2.21/0.94 % Runner terminated.
% 2.21/0.95 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------