TSTP Solution File: LCL512+1 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : LCL512+1 : TPTP v8.1.2. Released v3.3.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.Q4T36mbr9M true
% Computer : n028.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:00:01 EDT 2023
% Result : Theorem 1.06s 0.77s
% Output : Refutation 1.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 15
% Syntax : Number of formulae : 27 ( 12 unt; 9 typ; 0 def)
% Number of atoms : 24 ( 3 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 79 ( 6 ~; 3 |; 0 &; 67 @)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 16 ( 0 ^; 16 !; 0 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
thf(sk__26_type,type,
sk__26: $i ).
thf(and_type,type,
and: $i > $i > $i ).
thf(is_a_theorem_type,type,
is_a_theorem: $i > $o ).
thf(equivalence_1_type,type,
equivalence_1: $o ).
thf(op_equiv_type,type,
op_equiv: $o ).
thf(kn2_type,type,
kn2: $o ).
thf(equiv_type,type,
equiv: $i > $i > $i ).
thf(sk__27_type,type,
sk__27: $i ).
thf(implies_type,type,
implies: $i > $i > $i ).
thf(equivalence_1,axiom,
( equivalence_1
<=> ! [X: $i,Y: $i] : ( is_a_theorem @ ( implies @ ( equiv @ X @ Y ) @ ( implies @ X @ Y ) ) ) ) ).
thf(zip_derived_cl28,plain,
( equivalence_1
| ~ ( is_a_theorem @ ( implies @ ( equiv @ sk__26 @ sk__27 ) @ ( implies @ sk__26 @ sk__27 ) ) ) ),
inference(cnf,[status(esa)],[equivalence_1]) ).
thf(hilbert_equivalence_1,conjecture,
equivalence_1 ).
thf(zf_stmt_0,negated_conjecture,
~ equivalence_1,
inference('cnf.neg',[status(esa)],[hilbert_equivalence_1]) ).
thf(zip_derived_cl71,plain,
~ equivalence_1,
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(zip_derived_cl351,plain,
~ ( is_a_theorem @ ( implies @ ( equiv @ sk__26 @ sk__27 ) @ ( implies @ sk__26 @ sk__27 ) ) ),
inference('dp-resolution',[status(thm)],[zip_derived_cl28,zip_derived_cl71]) ).
thf(rosser_op_equiv,axiom,
op_equiv ).
thf(zip_derived_cl62,plain,
op_equiv,
inference(cnf,[status(esa)],[rosser_op_equiv]) ).
thf(op_equiv,axiom,
( op_equiv
=> ! [X: $i,Y: $i] :
( ( equiv @ X @ Y )
= ( and @ ( implies @ X @ Y ) @ ( implies @ Y @ X ) ) ) ) ).
thf(zip_derived_cl59,plain,
! [X0: $i,X1: $i] :
( ( ( equiv @ X0 @ X1 )
= ( and @ ( implies @ X0 @ X1 ) @ ( implies @ X1 @ X0 ) ) )
| ~ op_equiv ),
inference(cnf,[status(esa)],[op_equiv]) ).
thf(zip_derived_cl346,plain,
! [X0: $i,X1: $i] :
( ( equiv @ X1 @ X0 )
= ( and @ ( implies @ X1 @ X0 ) @ ( implies @ X0 @ X1 ) ) ),
inference('dp-resolution',[status(thm)],[zip_derived_cl62,zip_derived_cl59]) ).
thf(rosser_kn2,axiom,
kn2 ).
thf(zip_derived_cl65,plain,
kn2,
inference(cnf,[status(esa)],[rosser_kn2]) ).
thf(kn2,axiom,
( kn2
<=> ! [P: $i,Q: $i] : ( is_a_theorem @ ( implies @ ( and @ P @ Q ) @ P ) ) ) ).
thf(zip_derived_cl35,plain,
! [X0: $i,X1: $i] :
( ( is_a_theorem @ ( implies @ ( and @ X0 @ X1 ) @ X0 ) )
| ~ kn2 ),
inference(cnf,[status(esa)],[kn2]) ).
thf(zip_derived_cl348,plain,
! [X0: $i,X1: $i] : ( is_a_theorem @ ( implies @ ( and @ X0 @ X1 ) @ X0 ) ),
inference('dp-resolution',[status(thm)],[zip_derived_cl65,zip_derived_cl35]) ).
thf(zip_derived_cl387,plain,
! [X0: $i,X1: $i] : ( is_a_theorem @ ( implies @ ( equiv @ X1 @ X0 ) @ ( implies @ X1 @ X0 ) ) ),
inference('s_sup+',[status(thm)],[zip_derived_cl346,zip_derived_cl348]) ).
thf(zip_derived_cl393,plain,
$false,
inference(demod,[status(thm)],[zip_derived_cl351,zip_derived_cl387]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL512+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.Q4T36mbr9M true
% 0.13/0.34 % Computer : n028.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 : Fri Aug 25 05:29:05 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.34 % Python version: Python 3.6.8
% 0.13/0.34 % Running in FO mode
% 0.19/0.67 % Total configuration time : 435
% 0.19/0.67 % Estimated wc time : 1092
% 0.19/0.67 % Estimated cpu time (7 cpus) : 156.0
% 0.19/0.72 % /export/starexec/sandbox/solver/bin/fo/fo6_bce.sh running for 75s
% 0.19/0.73 % /export/starexec/sandbox/solver/bin/fo/fo1_av.sh running for 75s
% 0.19/0.73 % /export/starexec/sandbox/solver/bin/fo/fo3_bce.sh running for 75s
% 1.06/0.75 % /export/starexec/sandbox/solver/bin/fo/fo7.sh running for 63s
% 1.06/0.75 % /export/starexec/sandbox/solver/bin/fo/fo13.sh running for 50s
% 1.06/0.75 % /export/starexec/sandbox/solver/bin/fo/fo5.sh running for 50s
% 1.06/0.76 % /export/starexec/sandbox/solver/bin/fo/fo4.sh running for 50s
% 1.06/0.77 % Solved by fo/fo6_bce.sh.
% 1.06/0.77 % BCE start: 72
% 1.06/0.77 % BCE eliminated: 2
% 1.06/0.77 % PE start: 70
% 1.06/0.77 logic: eq
% 1.06/0.77 % PE eliminated: 40
% 1.06/0.77 % done 19 iterations in 0.028s
% 1.06/0.77 % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 1.06/0.77 % SZS output start Refutation
% See solution above
% 1.06/0.77
% 1.06/0.77
% 1.06/0.77 % Terminating...
% 1.46/0.86 % Runner terminated.
% 1.46/0.87 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------