%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : ITP082^1 : TPTP v9.2.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.OCTqFcx8Nd true
% Computer : n011.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 Oct 2 04:38:46 PM UTC 2025
% Result : Theorem 0.57s 0.97s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 17 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 33 ( 6 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 159 ( 4 ~; 2 |; 0 &; 152 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 7 avg)
% Number of types : 9 ( 8 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 17 usr; 9 con; 0-7 aty)
% Number of variables : 15 ( 0 ^; 15 !; 0 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
thf(g_type,type,
g: $tType ).
thf(node_type,type,
node: $tType ).
thf(list_node_type,type,
list_node: $tType ).
thf(val_type,type,
val: $tType ).
thf(inEdges_type,type,
inEdges: g > node > list_P561207620_edgeD ).
thf(pred_phi_r_type,type,
pred_phi_r: node ).
thf(invar_type,type,
invar: g > $o ).
thf(phis_type,type,
phis: g > produc1432036078de_val > option_list_val ).
thf(list_P561207620_edgeD_type,type,
list_P561207620_edgeD: $tType ).
thf(set_val_type,type,
set_val: $tType ).
thf(append_node_type,type,
append_node: list_node > list_node > list_node ).
thf(produc1432036078de_val_type,type,
produc1432036078de_val: $tType ).
thf(ri_type,type,
ri: list_node ).
thf(defs_type,type,
defs: g > node > set_val ).
thf(rs_rest_type,type,
rs_rest: list_node ).
thf(i_type,type,
i: node ).
thf(rs_type,type,
rs: list_node ).
thf(cons_node_type,type,
cons_node: node > list_node > list_node ).
thf(sSA_CF551432799de_val_type,type,
sSA_CF551432799de_val: ( g > list_node ) > ( g > node > set_val ) > ( g > produc1432036078de_val > option_list_val ) > g > val > node ).
thf(alpha_n_type,type,
alpha_n: g > list_node ).
thf(tmp_type,type,
tmp: list_node ).
thf(r_type,type,
r: val ).
thf(option_list_val_type,type,
option_list_val: $tType ).
thf(g2_type,type,
g2: g ).
thf(graph_1012773594_edgeD_type,type,
graph_1012773594_edgeD: ( g > list_node ) > ( g > $o ) > ( g > node > list_P561207620_edgeD ) > g > node > list_node > node > $o ).
thf(conj_0,conjecture,
graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ i @ ( cons_node @ i @ rs_rest ) @ pred_phi_r ).
thf(zf_stmt_0,negated_conjecture,
~ ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ i @ ( cons_node @ i @ rs_rest ) @ pred_phi_r ),
inference('cnf.neg',[status(esa)],[conj_0]) ).
thf(zip_derived_cl22,plain,
~ ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ i @ ( cons_node @ i @ rs_rest ) @ pred_phi_r ),
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(fact_5_rs_H__props_I1_J,axiom,
graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r ) @ rs @ pred_phi_r ).
thf(zip_derived_cl3,plain,
graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r ) @ rs @ pred_phi_r,
inference(cnf,[status(esa)],[fact_5_rs_H__props_I1_J]) ).
thf(fact_7_rs_H__rest__prop,axiom,
( rs
= ( append_node @ ri @ rs_rest ) ) ).
thf(zip_derived_cl4,plain,
( rs
= ( append_node @ ri @ rs_rest ) ),
inference(cnf,[status(esa)],[fact_7_rs_H__rest__prop]) ).
thf(zip_derived_cl101,plain,
graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r ) @ ( append_node @ ri @ rs_rest ) @ pred_phi_r,
inference(demod,[status(thm)],[zip_derived_cl3,zip_derived_cl4]) ).
thf(fact_1_rs_H__rest__def,axiom,
( rs
= ( append_node @ tmp @ ( cons_node @ i @ rs_rest ) ) ) ).
thf(zip_derived_cl0,plain,
( rs
= ( append_node @ tmp @ ( cons_node @ i @ rs_rest ) ) ),
inference(cnf,[status(esa)],[fact_1_rs_H__rest__def]) ).
thf(zip_derived_cl4_001,plain,
( rs
= ( append_node @ ri @ rs_rest ) ),
inference(cnf,[status(esa)],[fact_7_rs_H__rest__prop]) ).
thf(zip_derived_cl23,plain,
( ( append_node @ ri @ rs_rest )
= ( append_node @ tmp @ ( cons_node @ i @ rs_rest ) ) ),
inference(demod,[status(thm)],[zip_derived_cl0,zip_derived_cl4]) ).
thf(fact_3_old_Opath2__split_I2_J,axiom,
! [G: g,N: node,Ns: list_node,N2: node,Ns2: list_node,M: node] :
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ G @ N @ ( append_node @ Ns @ ( cons_node @ N2 @ Ns2 ) ) @ M )
=> ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ G @ N2 @ ( cons_node @ N2 @ Ns2 ) @ M ) ) ).
thf(zip_derived_cl2,plain,
! [X0: g,X1: node,X2: list_node,X3: node,X4: node,X5: list_node] :
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X0 @ X1 @ ( cons_node @ X1 @ X2 ) @ X3 )
| ~ ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X0 @ X4 @ ( append_node @ X5 @ ( cons_node @ X1 @ X2 ) ) @ X3 ) ),
inference(cnf,[status(esa)],[fact_3_old_Opath2__split_I2_J]) ).
thf(zip_derived_cl95,plain,
! [X0: node,X1: node,X2: g] :
( ~ ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X2 @ X1 @ ( append_node @ ri @ rs_rest ) @ X0 )
| ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X2 @ i @ ( cons_node @ i @ rs_rest ) @ X0 ) ),
inference('sup-',[status(thm)],[zip_derived_cl23,zip_derived_cl2]) ).
thf(zip_derived_cl236,plain,
graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ i @ ( cons_node @ i @ rs_rest ) @ pred_phi_r,
inference('sup-',[status(thm)],[zip_derived_cl101,zip_derived_cl95]) ).
thf(zip_derived_cl238,plain,
$false,
inference(demod,[status(thm)],[zip_derived_cl22,zip_derived_cl236]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : ITP082^1 : TPTP v9.2.0. Released v7.5.0.
% 0.06/0.13 % Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.OCTqFcx8Nd true
% 0.13/0.34 % Computer : n011.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 : Wed Oct 1 15:29:23 EDT 2025
% 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.34 % Python version: Python 3.6.8
% 0.13/0.35 % Running in HO mode
% 0.54/0.64 % Total configuration time : 828
% 0.54/0.64 % Estimated wc time : 1656
% 0.54/0.64 % Estimated cpu time (8 cpus) : 207.0
% 0.54/0.72 % /export/starexec/sandbox/solver/bin/lams/40_c.s.sh running for 80s
% 0.54/0.73 % /export/starexec/sandbox/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.54/0.77 % /export/starexec/sandbox/solver/bin/lams/40_c_ic.sh running for 80s
% 0.54/0.77 % /export/starexec/sandbox/solver/bin/lams/15_e_short1.sh running for 30s
% 0.54/0.78 % /export/starexec/sandbox/solver/bin/lams/40_noforms.sh running for 90s
% 0.54/0.78 % /export/starexec/sandbox/solver/bin/lams/40_b.comb.sh running for 70s
% 0.54/0.79 % /export/starexec/sandbox/solver/bin/lams/30_sp5.sh running for 60s
% 0.54/0.79 % /export/starexec/sandbox/solver/bin/lams/20_acsne_simpl.sh running for 40s
% 0.56/0.89 % /export/starexec/sandbox/solver/bin/lams/30_b.l.sh running for 90s
% 0.57/0.97 % Solved by lams/40_c_ic.sh.
% 0.57/0.97 % done 51 iterations in 0.169s
% 0.57/0.97 % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 0.57/0.97 % SZS output start Refutation
% See solution above
% 0.57/0.97
% 0.57/0.97
% 0.57/0.97 % Terminating...
% 0.59/1.08 % Runner terminated.
% 2.55/1.08 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------