%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : COM002_1 : TPTP v9.2.0. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.Nm4k6aKHqO true
% Computer : n004.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:30:31 PM UTC 2025
% Result : Theorem 1.20s 0.76s
% Output : Refutation 1.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 31 ( 18 unt; 0 typ; 0 def)
% Number of atoms : 51 ( 0 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 141 ( 17 ~; 15 |; 2 &; 104 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 29 ( 0 ^; 29 !; 0 ?; 29 :)
% Comments :
%------------------------------------------------------------------------------
thf(state_type,type,
state: $tType ).
thf(statement_type,type,
statement: $tType ).
thf(label_type,type,
label: $tType ).
thf(p8_type,type,
p8: state ).
thf(succeeds_type,type,
succeeds: state > state > $o ).
thf(p6_type,type,
p6: state ).
thf(p3_type,type,
p3: state ).
thf(goto_type,type,
goto: label > statement ).
thf(loop_type,type,
loop: label ).
thf(labels_type,type,
labels: label > state > $o ).
thf(follows_type,type,
follows: state > state > $o ).
thf(p7_type,type,
p7: state ).
thf(has_type,type,
has: state > statement > $o ).
thf(prove_there_is_a_loop_through_p3,conjecture,
succeeds @ p3 @ p3 ).
thf(zf_stmt_0,negated_conjecture,
~ ( succeeds @ p3 @ p3 ),
inference('cnf.neg',[status(esa)],[prove_there_is_a_loop_through_p3]) ).
thf(zip_derived_cl18,plain,
~ ( succeeds @ p3 @ p3 ),
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(state_8,axiom,
has @ p8 @ ( goto @ loop ) ).
thf(zip_derived_cl17,plain,
has @ p8 @ ( goto @ loop ),
inference(cnf,[status(esa)],[state_8]) ).
thf(goto_success,axiom,
! [Goal_state: state,Label: label,Start_state: state] :
( ( ( has @ Start_state @ ( goto @ Label ) )
& ( labels @ Label @ Goal_state ) )
=> ( succeeds @ Goal_state @ Start_state ) ) ).
thf(zip_derived_cl2,plain,
! [X0: label,X1: state,X2: state] :
( ~ ( labels @ X0 @ X1 )
| ~ ( has @ X2 @ ( goto @ X0 ) )
| ( succeeds @ X1 @ X2 ) ),
inference(cnf,[status(esa)],[goto_success]) ).
thf(zip_derived_cl33,plain,
! [X0: state] :
( ~ ( labels @ loop @ X0 )
| ( succeeds @ X0 @ p8 ) ),
inference('s_sup-',[status(thm)],[zip_derived_cl17,zip_derived_cl2]) ).
thf(label_state_3,axiom,
labels @ loop @ p3 ).
thf(zip_derived_cl7,plain,
labels @ loop @ p3,
inference(cnf,[status(esa)],[label_state_3]) ).
thf(zip_derived_cl49,plain,
succeeds @ p3 @ p8,
inference('s_sup+',[status(thm)],[zip_derived_cl33,zip_derived_cl7]) ).
thf(transition_7_to_8,axiom,
follows @ p8 @ p7 ).
thf(zip_derived_cl16,plain,
follows @ p8 @ p7,
inference(cnf,[status(esa)],[transition_7_to_8]) ).
thf(direct_success,axiom,
! [Start_state: state,Goal_state: state] :
( ( follows @ Goal_state @ Start_state )
=> ( succeeds @ Goal_state @ Start_state ) ) ).
thf(zip_derived_cl0,plain,
! [X0: state,X1: state] :
( ( succeeds @ X0 @ X1 )
| ~ ( follows @ X0 @ X1 ) ),
inference(cnf,[status(esa)],[direct_success]) ).
thf(transitivity_of_success,axiom,
! [Start_state: state,Intermediate_state: state,Goal_state: state] :
( ( ( succeeds @ Goal_state @ Intermediate_state )
& ( succeeds @ Intermediate_state @ Start_state ) )
=> ( succeeds @ Goal_state @ Start_state ) ) ).
thf(zip_derived_cl1,plain,
! [X0: state,X1: state,X2: state] :
( ~ ( succeeds @ X0 @ X1 )
| ~ ( succeeds @ X2 @ X0 )
| ( succeeds @ X2 @ X1 ) ),
inference(cnf,[status(esa)],[transitivity_of_success]) ).
thf(zip_derived_cl21,plain,
! [X0: state,X1: state,X2: state] :
( ~ ( follows @ X1 @ X0 )
| ~ ( succeeds @ X2 @ X1 )
| ( succeeds @ X2 @ X0 ) ),
inference('s_sup-',[status(thm)],[zip_derived_cl0,zip_derived_cl1]) ).
thf(zip_derived_cl29,plain,
! [X0: state] :
( ~ ( succeeds @ X0 @ p8 )
| ( succeeds @ X0 @ p7 ) ),
inference('s_sup-',[status(thm)],[zip_derived_cl16,zip_derived_cl21]) ).
thf(zip_derived_cl52,plain,
succeeds @ p3 @ p7,
inference('s_sup-',[status(thm)],[zip_derived_cl49,zip_derived_cl29]) ).
thf(transition_6_to_7,axiom,
follows @ p7 @ p6 ).
thf(zip_derived_cl14,plain,
follows @ p7 @ p6,
inference(cnf,[status(esa)],[transition_6_to_7]) ).
thf(zip_derived_cl21_001,plain,
! [X0: state,X1: state,X2: state] :
( ~ ( follows @ X1 @ X0 )
| ~ ( succeeds @ X2 @ X1 )
| ( succeeds @ X2 @ X0 ) ),
inference('s_sup-',[status(thm)],[zip_derived_cl0,zip_derived_cl1]) ).
thf(zip_derived_cl28,plain,
! [X0: state] :
( ~ ( succeeds @ X0 @ p7 )
| ( succeeds @ X0 @ p6 ) ),
inference('s_sup-',[status(thm)],[zip_derived_cl14,zip_derived_cl21]) ).
thf(zip_derived_cl54,plain,
succeeds @ p3 @ p6,
inference('s_sup-',[status(thm)],[zip_derived_cl52,zip_derived_cl28]) ).
thf(transition_3_to_6,axiom,
follows @ p6 @ p3 ).
thf(zip_derived_cl12,plain,
follows @ p6 @ p3,
inference(cnf,[status(esa)],[transition_3_to_6]) ).
thf(zip_derived_cl21_002,plain,
! [X0: state,X1: state,X2: state] :
( ~ ( follows @ X1 @ X0 )
| ~ ( succeeds @ X2 @ X1 )
| ( succeeds @ X2 @ X0 ) ),
inference('s_sup-',[status(thm)],[zip_derived_cl0,zip_derived_cl1]) ).
thf(zip_derived_cl27,plain,
! [X0: state] :
( ~ ( succeeds @ X0 @ p6 )
| ( succeeds @ X0 @ p3 ) ),
inference('s_sup-',[status(thm)],[zip_derived_cl12,zip_derived_cl21]) ).
thf(zip_derived_cl56,plain,
succeeds @ p3 @ p3,
inference('s_sup-',[status(thm)],[zip_derived_cl54,zip_derived_cl27]) ).
thf(zip_derived_cl57,plain,
$false,
inference(demod,[status(thm)],[zip_derived_cl18,zip_derived_cl56]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : COM002_1 : TPTP v9.2.0. Released v5.0.0.
% 0.00/0.10 % Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.Nm4k6aKHqO true
% 0.09/0.30 % Computer : n004.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Wed Oct 1 13:48:53 EDT 2025
% 0.09/0.30 % CPUTime :
% 0.09/0.30 % Running portfolio for 300 s
% 0.09/0.30 % File : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.30 % Number of cores: 8
% 0.09/0.30 % Python version: Python 3.6.8
% 0.09/0.30 % Running in FO mode
% 0.15/0.60 % Total configuration time : 435
% 0.15/0.60 % Estimated wc time : 1092
% 0.15/0.60 % Estimated cpu time (7 cpus) : 156.0
% 0.73/0.70 % /export/starexec/sandbox2/solver/bin/fo/fo3_bce.sh running for 75s
% 0.73/0.70 % /export/starexec/sandbox2/solver/bin/fo/fo6_bce.sh running for 75s
% 0.73/0.70 % /export/starexec/sandbox2/solver/bin/fo/fo1_av.sh running for 75s
% 1.20/0.71 % /export/starexec/sandbox2/solver/bin/fo/fo7.sh running for 63s
% 1.20/0.71 % /export/starexec/sandbox2/solver/bin/fo/fo13.sh running for 50s
% 1.20/0.71 % /export/starexec/sandbox2/solver/bin/fo/fo5.sh running for 50s
% 1.20/0.74 % /export/starexec/sandbox2/solver/bin/fo/fo4.sh running for 50s
% 1.20/0.76 % Solved by fo/fo1_av.sh.
% 1.20/0.76 % done 36 iterations in 0.021s
% 1.20/0.76 % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 1.20/0.76 % SZS output start Refutation
% See solution above
% 1.20/0.76
% 1.20/0.76
% 1.20/0.76 % Terminating...
% 1.40/0.81 % Runner terminated.
% 1.40/0.82 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------