%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : LCL612^1 : TPTP v9.3.1. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.fuHSATcvKk true
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Sep 7 01:36:17 PM UTC 2026
% Result : Theorem 0.39s 0.68s
% Output : Refutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 10
% Syntax : Number of formulae : 20 ( 16 unt; 0 typ; 0 def)
% Number of atoms : 40 ( 12 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 59 ( 8 ~; 6 |; 3 &; 39 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 30 ( 30 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 45 ( 24 ^; 21 !; 0 ?; 45 :)
% Comments :
%------------------------------------------------------------------------------
thf(mor_type,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(mnot_type,type,
mnot: ( $i > $o ) > $i > $o ).
thf(sk__9_type,type,
sk__9: $i > $o ).
thf(sk__10_type,type,
sk__10: $i > $o ).
thf(mimpl_type,type,
mimpl: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(sk__11_type,type,
sk__11: $i ).
thf(mvalid_type,type,
mvalid: ( $i > $o ) > $o ).
thf(mvalid,axiom,
( mvalid
= ( ^ [P: $i > $o] :
! [W: $i] : ( P @ W ) ) ) ).
thf('0',plain,
( mvalid
= ( ^ [P: $i > $o] :
! [W: $i] : ( P @ 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(mimpl,axiom,
( mimpl
= ( ^ [U: $i > $o,V: $i > $o] : ( mor @ ( mnot @ U ) @ V ) ) ) ).
thf(mor,axiom,
( mor
= ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
( ( X @ U )
| ( Y @ U ) ) ) ) ).
thf('2',plain,
( mor
= ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
( ( X @ U )
| ( Y @ U ) ) ) ),
inference(simplify_rw_rule,[status(thm)],[mor]) ).
thf('3',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
= ( ^ [X: $i > $o,U: $i] :
~ ( X @ U ) ) ) ).
thf('4',plain,
( mnot
= ( ^ [X: $i > $o,U: $i] :
~ ( X @ U ) ) ),
inference(simplify_rw_rule,[status(thm)],[mnot]) ).
thf('5',plain,
( mnot
= ( ^ [V_1: $i > $o,V_2: $i] :
~ ( V_1 @ V_2 ) ) ),
define([status(thm)]) ).
thf('6',plain,
( mimpl
= ( ^ [U: $i > $o,V: $i > $o] : ( mor @ ( mnot @ U ) @ V ) ) ),
inference(simplify_rw_rule,[status(thm)],[mimpl,'3','5']) ).
thf('7',plain,
( mimpl
= ( ^ [V_1: $i > $o,V_2: $i > $o] : ( mor @ ( mnot @ V_1 ) @ V_2 ) ) ),
define([status(thm)]) ).
thf(modus_ponens,conjecture,
! [R: $i > $i > $o,X: $i > $o,Y: $i > $o] :
( ( ( mvalid @ X )
& ( mvalid @ ( mimpl @ X @ Y ) ) )
=> ( mvalid @ Y ) ) ).
thf(zf_stmt_0,conjecture,
! [X4: $i > $i > $o,X6: $i > $o,X8: $i > $o] :
( ( ! [X10: $i] : ( X6 @ X10 )
& ! [X12: $i] :
( ~ ( X6 @ X12 )
| ( X8 @ X12 ) ) )
=> ! [X14: $i] : ( X8 @ X14 ) ) ).
thf(zf_stmt_1,negated_conjecture,
~ ! [X4: $i > $i > $o,X6: $i > $o,X8: $i > $o] :
( ( ! [X10: $i] : ( X6 @ X10 )
& ! [X12: $i] :
( ~ ( X6 @ X12 )
| ( X8 @ X12 ) ) )
=> ! [X14: $i] : ( X8 @ X14 ) ),
inference('cnf.neg',[status(esa)],[zf_stmt_0]) ).
thf(zip_derived_cl0,plain,
~ ( sk__10 @ sk__11 ),
inference(cnf,[status(esa)],[zf_stmt_1]) ).
thf(zip_derived_cl1,plain,
! [X0: $i] :
( ~ ( sk__9 @ X0 )
| ( sk__10 @ X0 ) ),
inference(cnf,[status(esa)],[zf_stmt_1]) ).
thf(zip_derived_cl2,plain,
! [X1: $i] : ( sk__9 @ X1 ),
inference(cnf,[status(esa)],[zf_stmt_1]) ).
thf(zip_derived_cl3,plain,
! [X0: $i] : ( sk__10 @ X0 ),
inference(demod,[status(thm)],[zip_derived_cl1,zip_derived_cl2]) ).
thf(zip_derived_cl4,plain,
$false,
inference(demod,[status(thm)],[zip_derived_cl0,zip_derived_cl3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL612^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.05 % Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.fuHSATcvKk true
% 0.09/0.35 % Computer : n007.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sun Sep 6 02:00:55 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 % Running portfolio for 300 s
% 0.09/0.36 % File : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36 % Number of cores: 8
% 0.09/0.36 % Python version: Python 3.12.3
% 0.09/0.37 % Running in HO mode
% 0.38/0.59 % Total configuration time : 828
% 0.38/0.59 % Estimated wc time : 1656
% 0.38/0.59 % Estimated cpu time (8 cpus) : 207.0
% 0.39/0.65 % /export/starexec/sandbox2/solver/bin/lams/40_c.s.sh running for 80s
% 0.39/0.68 % Solved by lams/40_c.s.sh.
% 0.39/0.68 % done 2 iterations in 0.008s
% 0.39/0.68 % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 0.39/0.68 % SZS output start Refutation
% See solution above
% 0.39/0.68
% 0.39/0.68
% 0.39/0.68 % /export/starexec/sandbox2/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.39/0.68 % Terminating...
% 0.86/0.72 % Runner terminated.
% 0.86/0.74 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------