TSTP Solution File: LCL499+1 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : LCL499+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : NO INFORMATION
% Format : NO INFORMATION
% Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.eE3SVd9aDW 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 08:59:58 EDT 2023
% Result : Theorem 1.02s 0.78s
% Output : Refutation 1.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 24
% Syntax : Number of formulae : 54 ( 26 unt; 12 typ; 0 def)
% Number of atoms : 63 ( 10 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 200 ( 16 ~; 13 |; 1 &; 163 @)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 45 ( 0 ^; 45 !; 0 ?; 45 :)
% Comments :
%------------------------------------------------------------------------------
thf(op_and_type,type,
op_and: $o ).
thf(and_type,type,
and: $i > $i > $i ).
thf(is_a_theorem_type,type,
is_a_theorem: $i > $o ).
thf(r1_type,type,
r1: $o ).
thf(or_type,type,
or: $i > $i > $i ).
thf(sk__32_type,type,
sk__32: $i ).
thf(op_implies_or_type,type,
op_implies_or: $o ).
thf(r3_type,type,
r3: $o ).
thf(kn1_type,type,
kn1: $o ).
thf(modus_ponens_type,type,
modus_ponens: $o ).
thf(implies_type,type,
implies: $i > $i > $i ).
thf(not_type,type,
not: $i > $i ).
thf(kn1,axiom,
( kn1
<=> ! [P: $i] : ( is_a_theorem @ ( implies @ P @ ( and @ P @ P ) ) ) ) ).
thf(zip_derived_cl34,plain,
( kn1
| ~ ( is_a_theorem @ ( implies @ sk__32 @ ( and @ sk__32 @ sk__32 ) ) ) ),
inference(cnf,[status(esa)],[kn1]) ).
thf(rosser_kn1,conjecture,
kn1 ).
thf(zf_stmt_0,negated_conjecture,
~ kn1,
inference('cnf.neg',[status(esa)],[rosser_kn1]) ).
thf(zip_derived_cl73,plain,
~ kn1,
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(zip_derived_cl363,plain,
~ ( is_a_theorem @ ( implies @ sk__32 @ ( and @ sk__32 @ sk__32 ) ) ),
inference('dp-resolution',[status(thm)],[zip_derived_cl34,zip_derived_cl73]) ).
thf(principia_op_implies_or,axiom,
op_implies_or ).
thf(zip_derived_cl60,plain,
op_implies_or,
inference(cnf,[status(esa)],[principia_op_implies_or]) ).
thf(op_implies_or,axiom,
( op_implies_or
=> ! [X: $i,Y: $i] :
( ( implies @ X @ Y )
= ( or @ ( not @ X ) @ Y ) ) ) ).
thf(zip_derived_cl58,plain,
! [X0: $i,X1: $i] :
( ( ( implies @ X0 @ X1 )
= ( or @ ( not @ X0 ) @ X1 ) )
| ~ op_implies_or ),
inference(cnf,[status(esa)],[op_implies_or]) ).
thf(zip_derived_cl337,plain,
! [X0: $i,X1: $i] :
( ( implies @ X1 @ X0 )
= ( or @ ( not @ X1 ) @ X0 ) ),
inference('dp-resolution',[status(thm)],[zip_derived_cl60,zip_derived_cl58]) ).
thf(principia_r1,axiom,
r1 ).
thf(zip_derived_cl64,plain,
r1,
inference(cnf,[status(esa)],[principia_r1]) ).
thf(r1,axiom,
( r1
<=> ! [P: $i] : ( is_a_theorem @ ( implies @ ( or @ P @ P ) @ P ) ) ) ).
thf(zip_derived_cl45,plain,
! [X0: $i] :
( ( is_a_theorem @ ( implies @ ( or @ X0 @ X0 ) @ X0 ) )
| ~ r1 ),
inference(cnf,[status(esa)],[r1]) ).
thf(zip_derived_cl357,plain,
! [X0: $i] : ( is_a_theorem @ ( implies @ ( or @ X0 @ X0 ) @ X0 ) ),
inference('dp-resolution',[status(thm)],[zip_derived_cl64,zip_derived_cl45]) ).
thf(zip_derived_cl373,plain,
! [X0: $i] : ( is_a_theorem @ ( implies @ ( implies @ X0 @ ( not @ X0 ) ) @ ( not @ X0 ) ) ),
inference('s_sup+',[status(thm)],[zip_derived_cl337,zip_derived_cl357]) ).
thf(zip_derived_cl337_001,plain,
! [X0: $i,X1: $i] :
( ( implies @ X1 @ X0 )
= ( or @ ( not @ X1 ) @ X0 ) ),
inference('dp-resolution',[status(thm)],[zip_derived_cl60,zip_derived_cl58]) ).
thf(zip_derived_cl337_002,plain,
! [X0: $i,X1: $i] :
( ( implies @ X1 @ X0 )
= ( or @ ( not @ X1 ) @ X0 ) ),
inference('dp-resolution',[status(thm)],[zip_derived_cl60,zip_derived_cl58]) ).
thf(principia_r3,axiom,
r3 ).
thf(zip_derived_cl66,plain,
r3,
inference(cnf,[status(esa)],[principia_r3]) ).
thf(r3,axiom,
( r3
<=> ! [P: $i,Q: $i] : ( is_a_theorem @ ( implies @ ( or @ P @ Q ) @ ( or @ Q @ P ) ) ) ) ).
thf(zip_derived_cl49,plain,
! [X0: $i,X1: $i] :
( ( is_a_theorem @ ( implies @ ( or @ X0 @ X1 ) @ ( or @ X1 @ X0 ) ) )
| ~ r3 ),
inference(cnf,[status(esa)],[r3]) ).
thf(zip_derived_cl359,plain,
! [X0: $i,X1: $i] : ( is_a_theorem @ ( implies @ ( or @ X0 @ X1 ) @ ( or @ X1 @ X0 ) ) ),
inference('dp-resolution',[status(thm)],[zip_derived_cl66,zip_derived_cl49]) ).
thf(principia_modus_ponens,axiom,
modus_ponens ).
thf(zip_derived_cl63,plain,
modus_ponens,
inference(cnf,[status(esa)],[principia_modus_ponens]) ).
thf(modus_ponens,axiom,
( modus_ponens
<=> ! [X: $i,Y: $i] :
( ( ( is_a_theorem @ X )
& ( is_a_theorem @ ( implies @ X @ Y ) ) )
=> ( is_a_theorem @ Y ) ) ) ).
thf(zip_derived_cl0,plain,
! [X0: $i,X1: $i] :
( ( is_a_theorem @ X0 )
| ~ ( is_a_theorem @ ( implies @ X1 @ X0 ) )
| ~ ( is_a_theorem @ X1 )
| ~ modus_ponens ),
inference(cnf,[status(esa)],[modus_ponens]) ).
thf(zip_derived_cl365,plain,
! [X0: $i,X1: $i] :
( ~ ( is_a_theorem @ X1 )
| ~ ( is_a_theorem @ ( implies @ X1 @ X0 ) )
| ( is_a_theorem @ X0 ) ),
inference('dp-resolution',[status(thm)],[zip_derived_cl63,zip_derived_cl0]) ).
thf(zip_derived_cl403,plain,
! [X0: $i,X1: $i] :
( ~ ( is_a_theorem @ ( or @ X0 @ X1 ) )
| ( is_a_theorem @ ( or @ X1 @ X0 ) ) ),
inference('s_sup-',[status(thm)],[zip_derived_cl359,zip_derived_cl365]) ).
thf(zip_derived_cl425,plain,
! [X0: $i,X1: $i] :
( ~ ( is_a_theorem @ ( implies @ X1 @ X0 ) )
| ( is_a_theorem @ ( or @ X0 @ ( not @ X1 ) ) ) ),
inference('s_sup-',[status(thm)],[zip_derived_cl337,zip_derived_cl403]) ).
thf(zip_derived_cl554,plain,
! [X0: $i,X1: $i] :
( ~ ( is_a_theorem @ ( implies @ X0 @ ( not @ X1 ) ) )
| ( is_a_theorem @ ( implies @ X1 @ ( not @ X0 ) ) ) ),
inference('s_sup+',[status(thm)],[zip_derived_cl337,zip_derived_cl425]) ).
thf(zip_derived_cl561,plain,
! [X0: $i] : ( is_a_theorem @ ( implies @ X0 @ ( not @ ( implies @ X0 @ ( not @ X0 ) ) ) ) ),
inference('s_sup-',[status(thm)],[zip_derived_cl373,zip_derived_cl554]) ).
thf(principia_op_and,axiom,
op_and ).
thf(zip_derived_cl61,plain,
op_and,
inference(cnf,[status(esa)],[principia_op_and]) ).
thf(op_and,axiom,
( op_and
=> ! [X: $i,Y: $i] :
( ( and @ X @ Y )
= ( not @ ( or @ ( not @ X ) @ ( not @ Y ) ) ) ) ) ).
thf(zip_derived_cl56,plain,
! [X0: $i,X1: $i] :
( ( ( and @ X0 @ X1 )
= ( not @ ( or @ ( not @ X0 ) @ ( not @ X1 ) ) ) )
| ~ op_and ),
inference(cnf,[status(esa)],[op_and]) ).
thf(zip_derived_cl335,plain,
! [X0: $i,X1: $i] :
( ( and @ X1 @ X0 )
= ( not @ ( or @ ( not @ X1 ) @ ( not @ X0 ) ) ) ),
inference('dp-resolution',[status(thm)],[zip_derived_cl61,zip_derived_cl56]) ).
thf(zip_derived_cl337_003,plain,
! [X0: $i,X1: $i] :
( ( implies @ X1 @ X0 )
= ( or @ ( not @ X1 ) @ X0 ) ),
inference('dp-resolution',[status(thm)],[zip_derived_cl60,zip_derived_cl58]) ).
thf(zip_derived_cl375,plain,
! [X0: $i,X1: $i] :
( ( and @ X1 @ X0 )
= ( not @ ( implies @ X1 @ ( not @ X0 ) ) ) ),
inference(demod,[status(thm)],[zip_derived_cl335,zip_derived_cl337]) ).
thf(zip_derived_cl569,plain,
! [X0: $i] : ( is_a_theorem @ ( implies @ X0 @ ( and @ X0 @ X0 ) ) ),
inference(demod,[status(thm)],[zip_derived_cl561,zip_derived_cl375]) ).
thf(zip_derived_cl649,plain,
$false,
inference(demod,[status(thm)],[zip_derived_cl363,zip_derived_cl569]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL499+1 : TPTP v8.1.2. Released v3.3.0.
% 0.13/0.13 % Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.eE3SVd9aDW 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:37:23 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.34 % Running portfolio for 300 s
% 0.13/0.34 % File : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.34 % Number of cores: 8
% 0.13/0.34 % Python version: Python 3.6.8
% 0.13/0.34 % Running in FO mode
% 0.20/0.65 % Total configuration time : 435
% 0.20/0.65 % Estimated wc time : 1092
% 0.20/0.65 % Estimated cpu time (7 cpus) : 156.0
% 0.20/0.70 % /export/starexec/sandbox2/solver/bin/fo/fo6_bce.sh running for 75s
% 0.20/0.72 % /export/starexec/sandbox2/solver/bin/fo/fo3_bce.sh running for 75s
% 0.20/0.72 % /export/starexec/sandbox2/solver/bin/fo/fo1_av.sh running for 75s
% 0.20/0.74 % /export/starexec/sandbox2/solver/bin/fo/fo13.sh running for 50s
% 0.20/0.74 % /export/starexec/sandbox2/solver/bin/fo/fo7.sh running for 63s
% 0.20/0.74 % /export/starexec/sandbox2/solver/bin/fo/fo5.sh running for 50s
% 0.20/0.74 % /export/starexec/sandbox2/solver/bin/fo/fo4.sh running for 50s
% 0.20/0.77 % /export/starexec/sandbox2/solver/bin/fo/fo1_lcnf.sh running for 50s
% 1.02/0.78 % Solved by fo/fo6_bce.sh.
% 1.02/0.78 % BCE start: 74
% 1.02/0.78 % BCE eliminated: 0
% 1.02/0.78 % PE start: 74
% 1.02/0.78 logic: eq
% 1.02/0.78 % PE eliminated: 42
% 1.02/0.78 % done 81 iterations in 0.066s
% 1.02/0.78 % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 1.02/0.78 % SZS output start Refutation
% See solution above
% 1.02/0.78
% 1.02/0.78
% 1.02/0.78 % Terminating...
% 1.52/0.84 % Runner terminated.
% 1.52/0.86 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------