TSTP Solution File: SYN940+1 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : SYN940+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : NO INFORMATION
% Format : NO INFORMATION
% Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.w61BBub73Z true
% Computer : n023.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 Sep 1 04:06:18 EDT 2023
% Result : Theorem 0.57s 0.73s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 23 ( 8 unt; 6 typ; 0 def)
% Number of atoms : 42 ( 0 equ; 0 cnn)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 95 ( 17 ~; 13 |; 6 &; 53 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 6 usr; 3 con; 0-1 aty)
% Number of variables : 31 ( 0 ^; 27 !; 4 ?; 31 :)
% Comments :
%------------------------------------------------------------------------------
thf(f_type,type,
f: $i > $i ).
thf(q_type,type,
q: $i > $o ).
thf(sk__1_type,type,
sk__1: $i ).
thf(p_type,type,
p: $i > $o ).
thf(r_type,type,
r: $i > $o ).
thf(sk__type,type,
sk_: $i ).
thf(prove_this,conjecture,
! [B: $i,C: $i] :
( ! [Z: $i] : ( q @ ( f @ Z ) )
=> ? [X: $i,Y: $i] :
( ( q @ X )
& ( ( p @ ( f @ Y ) )
=> ( ( p @ X )
& ( ( r @ Y )
=> ( ( r @ B )
& ( r @ C ) ) ) ) ) ) ) ).
thf(zf_stmt_0,negated_conjecture,
~ ! [B: $i,C: $i] :
( ! [Z: $i] : ( q @ ( f @ Z ) )
=> ? [X: $i,Y: $i] :
( ( q @ X )
& ( ( p @ ( f @ Y ) )
=> ( ( p @ X )
& ( ( r @ Y )
=> ( ( r @ B )
& ( r @ C ) ) ) ) ) ) ),
inference('cnf.neg',[status(esa)],[prove_this]) ).
thf(zip_derived_cl2,plain,
! [X0: $i,X1: $i] :
( ~ ( q @ X0 )
| ( p @ ( f @ X1 ) ) ),
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(zip_derived_cl1,plain,
! [X0: $i] :
( ~ ( q @ X0 )
| ~ ( p @ X0 )
| ~ ( r @ sk_ )
| ~ ( r @ sk__1 ) ),
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(zip_derived_cl5,plain,
! [X0: $i,X1: $i] :
( ~ ( q @ X1 )
| ~ ( r @ sk__1 )
| ~ ( r @ sk_ )
| ~ ( q @ ( f @ X0 ) ) ),
inference('dp-resolution',[status(thm)],[zip_derived_cl2,zip_derived_cl1]) ).
thf(zip_derived_cl3,plain,
! [X2: $i] : ( q @ ( f @ X2 ) ),
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(zip_derived_cl2_001,plain,
! [X0: $i,X1: $i] :
( ~ ( q @ X0 )
| ( p @ ( f @ X1 ) ) ),
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(zip_derived_cl0,plain,
! [X0: $i,X1: $i] :
( ~ ( q @ X0 )
| ~ ( p @ X0 )
| ( r @ X1 ) ),
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(zip_derived_cl4,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ ( q @ X2 )
| ( r @ X0 )
| ~ ( q @ ( f @ X1 ) ) ),
inference('dp-resolution',[status(thm)],[zip_derived_cl2,zip_derived_cl0]) ).
thf(zip_derived_cl3_002,plain,
! [X2: $i] : ( q @ ( f @ X2 ) ),
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(zip_derived_cl6,plain,
! [X0: $i,X2: $i] :
( ~ ( q @ X2 )
| ( r @ X0 ) ),
inference(demod,[status(thm)],[zip_derived_cl4,zip_derived_cl3]) ).
thf(zip_derived_cl7,plain,
! [X1: $i] : ( r @ X1 ),
inference('sup-',[status(thm)],[zip_derived_cl3,zip_derived_cl6]) ).
thf(zip_derived_cl7_003,plain,
! [X1: $i] : ( r @ X1 ),
inference('sup-',[status(thm)],[zip_derived_cl3,zip_derived_cl6]) ).
thf(zip_derived_cl3_004,plain,
! [X2: $i] : ( q @ ( f @ X2 ) ),
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(zip_derived_cl8,plain,
! [X1: $i] :
~ ( q @ X1 ),
inference(demod,[status(thm)],[zip_derived_cl5,zip_derived_cl7,zip_derived_cl7,zip_derived_cl3]) ).
thf(zip_derived_cl3_005,plain,
! [X2: $i] : ( q @ ( f @ X2 ) ),
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(zip_derived_cl9,plain,
$false,
inference('sup+',[status(thm)],[zip_derived_cl8,zip_derived_cl3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : SYN940+1 : TPTP v8.1.2. Released v3.1.0.
% 0.10/0.14 % Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.w61BBub73Z true
% 0.13/0.35 % Computer : n023.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat Aug 26 21:36:41 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % Running portfolio for 300 s
% 0.13/0.35 % File : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.35 % Number of cores: 8
% 0.13/0.35 % Python version: Python 3.6.8
% 0.13/0.36 % Running in FO mode
% 0.56/0.64 % Total configuration time : 435
% 0.56/0.64 % Estimated wc time : 1092
% 0.56/0.64 % Estimated cpu time (7 cpus) : 156.0
% 0.56/0.70 % /export/starexec/sandbox/solver/bin/fo/fo6_bce.sh running for 75s
% 0.57/0.71 % /export/starexec/sandbox/solver/bin/fo/fo3_bce.sh running for 75s
% 0.57/0.73 % Solved by fo/fo3_bce.sh.
% 0.57/0.73 % BCE start: 4
% 0.57/0.73 % BCE eliminated: 0
% 0.57/0.73 % PE start: 4
% 0.57/0.73 logic: neq
% 0.57/0.73 % PE eliminated: 1
% 0.57/0.73 % done 3 iterations in 0.006s
% 0.57/0.73 % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 0.57/0.73 % SZS output start Refutation
% See solution above
% 0.57/0.73
% 0.57/0.73
% 0.57/0.73 % Terminating...
% 0.62/0.84 % Runner terminated.
% 1.53/0.86 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------