TSTP Solution File: LCL709^1 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : LCL709^1 : TPTP v8.1.2. Bugfixed v5.0.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.5nYMrdnI0w true
% Computer : n003.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 09:01:41 EDT 2023
% Result : Theorem 0.21s 0.80s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 26
% Syntax : Number of formulae : 40 ( 25 unt; 10 typ; 0 def)
% Number of atoms : 59 ( 21 equ; 0 cnn)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 107 ( 13 ~; 13 |; 0 &; 78 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 90 ( 90 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 2 con; 0-3 aty)
% Number of variables : 72 ( 43 ^; 29 !; 0 ?; 72 :)
% Comments :
%------------------------------------------------------------------------------
thf(sk__5_type,type,
sk__5: $i ).
thf(mbox_type,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(sk__4_type,type,
sk__4: $i > $i > $o ).
thf(mreflexive_type,type,
mreflexive: ( $i > $i > $o ) > $o ).
thf(mnot_type,type,
mnot: ( $i > $o ) > $i > $o ).
thf(mimplies_type,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(sk__6_type,type,
sk__6: ( $i > $o ) > $i > $i ).
thf(mor_type,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(mforall_prop_type,type,
mforall_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
thf(mvalid_type,type,
mvalid: ( $i > $o ) > $o ).
thf(mvalid,axiom,
( mvalid
= ( ^ [Phi: $i > $o] :
! [W: $i] : ( Phi @ W ) ) ) ).
thf('0',plain,
( mvalid
= ( ^ [Phi: $i > $o] :
! [W: $i] : ( Phi @ W ) ) ),
inference(simplify_rw_rule,[status(thm)],[mvalid]) ).
thf('1',plain,
( mvalid
= ( ^ [V_1: $i > $o] :
! [X4: $i] : ( V_1 @ X4 ) ) ),
define([status(thm)]) ).
thf(mreflexive,axiom,
( mreflexive
= ( ^ [R: $i > $i > $o] :
! [S: $i] : ( R @ S @ S ) ) ) ).
thf('2',plain,
( mreflexive
= ( ^ [R: $i > $i > $o] :
! [S: $i] : ( R @ S @ S ) ) ),
inference(simplify_rw_rule,[status(thm)],[mreflexive]) ).
thf('3',plain,
( mreflexive
= ( ^ [V_1: $i > $i > $o] :
! [X4: $i] : ( V_1 @ X4 @ X4 ) ) ),
define([status(thm)]) ).
thf(mbox,axiom,
( mbox
= ( ^ [R: $i > $i > $o,Phi: $i > $o,W: $i] :
! [V: $i] :
( ( Phi @ V )
| ~ ( R @ W @ V ) ) ) ) ).
thf('4',plain,
( mbox
= ( ^ [R: $i > $i > $o,Phi: $i > $o,W: $i] :
! [V: $i] :
( ( Phi @ V )
| ~ ( R @ W @ V ) ) ) ),
inference(simplify_rw_rule,[status(thm)],[mbox]) ).
thf('5',plain,
( mbox
= ( ^ [V_1: $i > $i > $o,V_2: $i > $o,V_3: $i] :
! [X4: $i] :
( ( V_2 @ X4 )
| ~ ( V_1 @ V_3 @ X4 ) ) ) ),
define([status(thm)]) ).
thf(mforall_prop,axiom,
( mforall_prop
= ( ^ [Phi: ( $i > $o ) > $i > $o,W: $i] :
! [P: $i > $o] : ( Phi @ P @ W ) ) ) ).
thf('6',plain,
( mforall_prop
= ( ^ [Phi: ( $i > $o ) > $i > $o,W: $i] :
! [P: $i > $o] : ( Phi @ P @ W ) ) ),
inference(simplify_rw_rule,[status(thm)],[mforall_prop]) ).
thf('7',plain,
( mforall_prop
= ( ^ [V_1: ( $i > $o ) > $i > $o,V_2: $i] :
! [X4: $i > $o] : ( V_1 @ X4 @ V_2 ) ) ),
define([status(thm)]) ).
thf(mimplies,axiom,
( mimplies
= ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mor @ ( mnot @ Phi ) @ Psi ) ) ) ).
thf(mor,axiom,
( mor
= ( ^ [Phi: $i > $o,Psi: $i > $o,W: $i] :
( ( Phi @ W )
| ( Psi @ W ) ) ) ) ).
thf('8',plain,
( mor
= ( ^ [Phi: $i > $o,Psi: $i > $o,W: $i] :
( ( Phi @ W )
| ( Psi @ W ) ) ) ),
inference(simplify_rw_rule,[status(thm)],[mor]) ).
thf('9',plain,
( mor
= ( ^ [V_1: $i > $o,V_2: $i > $o,V_3: $i] :
( ( V_1 @ V_3 )
| ( V_2 @ V_3 ) ) ) ),
define([status(thm)]) ).
thf(mnot,axiom,
( mnot
= ( ^ [Phi: $i > $o,W: $i] :
~ ( Phi @ W ) ) ) ).
thf('10',plain,
( mnot
= ( ^ [Phi: $i > $o,W: $i] :
~ ( Phi @ W ) ) ),
inference(simplify_rw_rule,[status(thm)],[mnot]) ).
thf('11',plain,
( mnot
= ( ^ [V_1: $i > $o,V_2: $i] :
~ ( V_1 @ V_2 ) ) ),
define([status(thm)]) ).
thf('12',plain,
( mimplies
= ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mor @ ( mnot @ Phi ) @ Psi ) ) ),
inference(simplify_rw_rule,[status(thm)],[mimplies,'9','11']) ).
thf('13',plain,
( mimplies
= ( ^ [V_1: $i > $o,V_2: $i > $o] : ( mor @ ( mnot @ V_1 ) @ V_2 ) ) ),
define([status(thm)]) ).
thf(conj,conjecture,
! [R: $i > $i > $o] :
( ( mvalid
@ ( mforall_prop
@ ^ [A: $i > $o] : ( mimplies @ ( mbox @ R @ A ) @ A ) ) )
=> ( mreflexive @ R ) ) ).
thf(zf_stmt_0,conjecture,
! [X4: $i > $i > $o] :
( ! [X6: $i,X8: $i > $o] :
( ~ ! [X10: $i] :
( ( X8 @ X10 )
| ~ ( X4 @ X6 @ X10 ) )
| ( X8 @ X6 ) )
=> ! [X12: $i] : ( X4 @ X12 @ X12 ) ) ).
thf(zf_stmt_1,negated_conjecture,
~ ! [X4: $i > $i > $o] :
( ! [X6: $i,X8: $i > $o] :
( ~ ! [X10: $i] :
( ( X8 @ X10 )
| ~ ( X4 @ X6 @ X10 ) )
| ( X8 @ X6 ) )
=> ! [X12: $i] : ( X4 @ X12 @ X12 ) ),
inference('cnf.neg',[status(esa)],[zf_stmt_0]) ).
thf(zip_derived_cl2,plain,
~ ( sk__4 @ sk__5 @ sk__5 ),
inference(cnf,[status(esa)],[zf_stmt_1]) ).
thf(zip_derived_cl1,plain,
! [X0: $i > $o,X1: $i] :
( ( sk__4 @ X1 @ ( sk__6 @ X0 @ X1 ) )
| ( X0 @ X1 ) ),
inference(cnf,[status(esa)],[zf_stmt_1]) ).
thf(zip_derived_cl0,plain,
! [X0: $i > $o,X1: $i] :
( ~ ( X0 @ ( sk__6 @ X0 @ X1 ) )
| ( X0 @ X1 ) ),
inference(cnf,[status(esa)],[zf_stmt_1]) ).
thf(zip_derived_cl45,plain,
! [X0: $i] :
( ( sk__4 @ X0 @ X0 )
| ( sk__4 @ X0 @ X0 ) ),
inference('sup-',[status(thm)],[zip_derived_cl1,zip_derived_cl0]) ).
thf(zip_derived_cl78,plain,
! [X0: $i] : ( sk__4 @ X0 @ X0 ),
inference(simplify,[status(thm)],[zip_derived_cl45]) ).
thf(zip_derived_cl84,plain,
$false,
inference(demod,[status(thm)],[zip_derived_cl2,zip_derived_cl78]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL709^1 : TPTP v8.1.2. Bugfixed v5.0.0.
% 0.13/0.13 % Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.5nYMrdnI0w true
% 0.13/0.34 % Computer : n003.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 24 18:10:07 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.34 % Running portfolio for 300 s
% 0.13/0.34 % File : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.34 % Number of cores: 8
% 0.13/0.35 % Python version: Python 3.6.8
% 0.13/0.35 % Running in HO mode
% 0.21/0.67 % Total configuration time : 828
% 0.21/0.67 % Estimated wc time : 1656
% 0.21/0.67 % Estimated cpu time (8 cpus) : 207.0
% 0.21/0.72 % /export/starexec/sandbox/solver/bin/lams/40_c.s.sh running for 80s
% 0.21/0.72 % /export/starexec/sandbox/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.21/0.72 % /export/starexec/sandbox/solver/bin/lams/15_e_short1.sh running for 30s
% 0.21/0.73 % /export/starexec/sandbox/solver/bin/lams/40_c_ic.sh running for 80s
% 0.21/0.75 % /export/starexec/sandbox/solver/bin/lams/40_noforms.sh running for 90s
% 0.21/0.76 % /export/starexec/sandbox/solver/bin/lams/40_b.comb.sh running for 70s
% 0.21/0.76 % /export/starexec/sandbox/solver/bin/lams/20_acsne_simpl.sh running for 40s
% 0.21/0.76 % /export/starexec/sandbox/solver/bin/lams/30_sp5.sh running for 60s
% 0.21/0.80 % Solved by lams/40_c.s.sh.
% 0.21/0.80 % done 8 iterations in 0.049s
% 0.21/0.80 % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 0.21/0.80 % SZS output start Refutation
% See solution above
% 0.21/0.81
% 0.21/0.81
% 0.21/0.81 % Terminating...
% 1.83/0.86 % Runner terminated.
% 1.83/0.87 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------