TSTP Solution File: SWV442^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWV442^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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 : Tue May 21 05:24:51 EDT 2024
% Result : Theorem 0.18s 0.48s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 26
% Syntax : Number of formulae : 47 ( 28 unt; 15 typ; 0 def)
% Number of atoms : 84 ( 25 equ; 0 cnn)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 128 ( 14 ~; 11 |; 3 &; 87 @)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 84 ( 84 >; 0 *; 0 +; 0 <<)
% Number of symbols : 17 ( 15 usr; 4 con; 0-3 aty)
% Number of variables : 76 ( 54 ^ 22 !; 0 ?; 76 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_28,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_29,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_31,type,
mimpl: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_33,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_37,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_41,type,
reli: $i > $i > $o ).
thf(decl_43,type,
cs4_atom: ( $i > $o ) > $i > $o ).
thf(decl_46,type,
cs4_impl: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_53,type,
bl_atom: ( $i > $o ) > $i > $o ).
thf(decl_57,type,
bl_impl: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_62,type,
bl_valid: ( $i > $o ) > $o ).
thf(decl_70,type,
epred1_0: $i > $o ).
thf(decl_71,type,
esk7_0: $i ).
thf(decl_72,type,
esk8_0: $i ).
thf(decl_73,type,
esk9_0: $i ).
thf(mimpl,axiom,
( mimpl
= ( ^ [X7: $i > $o,X8: $i > $o] : ( mor @ ( mnot @ X7 ) @ X8 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mimpl) ).
thf(mnot,axiom,
( mnot
= ( ^ [X2: $i > $o,X3: $i] :
~ ( X2 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X4: $i > $o,X5: $i > $o,X3: $i] :
( ( X4 @ X3 )
| ( X5 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mor) ).
thf(cs4_atom,axiom,
( cs4_atom
= ( ^ [X11: $i > $o] : ( mbox @ reli @ X11 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL009^0.ax',cs4_atom) ).
thf(mbox,axiom,
( mbox
= ( ^ [X10: $i > $i > $o,X11: $i > $o,X1: $i] :
! [X12: $i] :
( ( X10 @ X1 @ X12 )
=> ( X11 @ X12 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mbox) ).
thf(cs4_impl,axiom,
( cs4_impl
= ( ^ [X19: $i > $o,X20: $i > $o] : ( mbox @ reli @ ( mimpl @ X19 @ X20 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL009^0.ax',cs4_impl) ).
thf(bl_atom,axiom,
( bl_atom
= ( ^ [X11: $i > $o] : ( cs4_atom @ X11 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV010^0.ax',bl_atom) ).
thf(bl_impl,axiom,
( bl_impl
= ( ^ [X19: $i > $o,X20: $i > $o] : ( cs4_impl @ X19 @ X20 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV010^0.ax',bl_impl) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X11: $i > $o] :
! [X15: $i] : ( X11 @ X15 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mvalid) ).
thf(bl_valid_def,axiom,
( bl_valid
= ( ^ [Z0: $i > $o] :
! [X46: $i] : ( Z0 @ X46 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV010^0.ax',bl_valid_def) ).
thf(bl_id,conjecture,
! [X19: $i > $o] : ( bl_valid @ ( bl_impl @ ( bl_atom @ X19 ) @ ( bl_atom @ X19 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',bl_id) ).
thf(c_0_11,plain,
( mimpl
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimpl]) ).
thf(c_0_12,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_13,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_14,plain,
( cs4_atom
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X30: $i] :
( ( reli @ Z1 @ X30 )
=> ( Z0 @ X30 ) ) ) ),
inference(fof_simplification,[status(thm)],[cs4_atom]) ).
thf(c_0_15,plain,
( mbox
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
! [X12: $i] :
( ( Z0 @ Z2 @ X12 )
=> ( Z1 @ X12 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox]) ).
thf(c_0_16,plain,
( cs4_impl
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
! [X31: $i] :
( ( reli @ Z2 @ X31 )
=> ( ~ ( Z0 @ X31 )
| ( Z1 @ X31 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[cs4_impl]) ).
thf(c_0_17,plain,
( mimpl
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
thf(c_0_18,plain,
( bl_atom
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X37: $i] :
( ( reli @ Z1 @ X37 )
=> ( Z0 @ X37 ) ) ) ),
inference(fof_simplification,[status(thm)],[bl_atom]) ).
thf(c_0_19,plain,
( cs4_atom
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X30: $i] :
( ( reli @ Z1 @ X30 )
=> ( Z0 @ X30 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_20,plain,
( bl_impl
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
! [X39: $i] :
( ( reli @ Z2 @ X39 )
=> ( ~ ( Z0 @ X39 )
| ( Z1 @ X39 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[bl_impl]) ).
thf(c_0_21,plain,
( cs4_impl
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
! [X31: $i] :
( ( reli @ Z2 @ X31 )
=> ( ~ ( Z0 @ X31 )
| ( Z1 @ X31 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_16,c_0_17]),c_0_15]) ).
thf(c_0_22,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X15: $i] : ( Z0 @ X15 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_23,plain,
( bl_atom
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X37: $i] :
( ( reli @ Z1 @ X37 )
=> ( Z0 @ X37 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_18,c_0_19]) ).
thf(c_0_24,plain,
( bl_impl
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
! [X39: $i] :
( ( reli @ Z2 @ X39 )
=> ( ~ ( Z0 @ X39 )
| ( Z1 @ X39 ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_20,c_0_21]) ).
thf(c_0_25,axiom,
( bl_valid
= ( ^ [Z0: $i > $o] :
! [X46: $i] : ( Z0 @ X46 ) ) ),
inference(apply_def,[status(thm)],[bl_valid_def,c_0_22]) ).
thf(c_0_26,negated_conjecture,
~ ! [X19: $i > $o,X71: $i,X70: $i] :
( ( reli @ X71 @ X70 )
=> ( ~ ! [X68: $i] :
( ( reli @ X70 @ X68 )
=> ( X19 @ X68 ) )
| ! [X69: $i] :
( ( reli @ X70 @ X69 )
=> ( X19 @ X69 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[bl_id]),c_0_23]),c_0_24]),c_0_25]) ).
thf(c_0_27,negated_conjecture,
! [X101: $i] :
( ( reli @ esk7_0 @ esk8_0 )
& ( ~ ( reli @ esk8_0 @ X101 )
| ( epred1_0 @ X101 ) )
& ( reli @ esk8_0 @ esk9_0 )
& ~ ( epred1_0 @ esk9_0 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])])])]) ).
thf(c_0_28,negated_conjecture,
! [X1: $i] :
( ( epred1_0 @ X1 )
| ~ ( reli @ esk8_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_29,negated_conjecture,
reli @ esk8_0 @ esk9_0,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_30,negated_conjecture,
~ ( epred1_0 @ esk9_0 ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_31,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV442^1 : TPTP v8.2.0. Released v3.7.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.32 % Computer : n017.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Sun May 19 07:33:23 EDT 2024
% 0.13/0.32 % CPUTime :
% 0.18/0.46 Running higher-order theorem proving
% 0.18/0.46 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.48 # Version: 3.1.0-ho
% 0.18/0.48 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.18/0.48 # Starting post_as_ho3 with 300s (1) cores
% 0.18/0.48 # Starting post_as_ho11 with 300s (1) cores
% 0.18/0.48 # Starting full_lambda_8 with 300s (1) cores
% 0.18/0.48 # post_as_ho11 with pid 355 completed with status 0
% 0.18/0.48 # Result found by post_as_ho11
% 0.18/0.48 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.18/0.48 # Starting post_as_ho3 with 300s (1) cores
% 0.18/0.48 # Starting post_as_ho11 with 300s (1) cores
% 0.18/0.48 # No SInE strategy applied
% 0.18/0.48 # Search class: HGUNF-FFSF22-SHSSMMBN
% 0.18/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.48 # Starting new_ho_10 with 163s (1) cores
% 0.18/0.48 # new_ho_10 with pid 365 completed with status 0
% 0.18/0.48 # Result found by new_ho_10
% 0.18/0.48 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.18/0.48 # Starting post_as_ho3 with 300s (1) cores
% 0.18/0.48 # Starting post_as_ho11 with 300s (1) cores
% 0.18/0.48 # No SInE strategy applied
% 0.18/0.48 # Search class: HGUNF-FFSF22-SHSSMMBN
% 0.18/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.48 # Starting new_ho_10 with 163s (1) cores
% 0.18/0.48 # Preprocessing time : 0.003 s
% 0.18/0.48 # Presaturation interreduction done
% 0.18/0.48
% 0.18/0.48 # Proof found!
% 0.18/0.48 # SZS status Theorem
% 0.18/0.48 # SZS output start CNFRefutation
% See solution above
% 0.18/0.48 # Parsed axioms : 84
% 0.18/0.48 # Removed by relevancy pruning/SinE : 0
% 0.18/0.48 # Initial clauses : 59
% 0.18/0.48 # Removed in clause preprocessing : 43
% 0.18/0.48 # Initial clauses in saturation : 16
% 0.18/0.48 # Processed clauses : 20
% 0.18/0.48 # ...of these trivial : 0
% 0.18/0.48 # ...subsumed : 0
% 0.18/0.48 # ...remaining for further processing : 20
% 0.18/0.48 # Other redundant clauses eliminated : 0
% 0.18/0.48 # Clauses deleted for lack of memory : 0
% 0.18/0.48 # Backward-subsumed : 0
% 0.18/0.48 # Backward-rewritten : 0
% 0.18/0.48 # Generated clauses : 1
% 0.18/0.48 # ...of the previous two non-redundant : 0
% 0.18/0.48 # ...aggressively subsumed : 0
% 0.18/0.48 # Contextual simplify-reflections : 0
% 0.18/0.48 # Paramodulations : 1
% 0.18/0.48 # Factorizations : 0
% 0.18/0.48 # NegExts : 0
% 0.18/0.48 # Equation resolutions : 0
% 0.18/0.48 # Disequality decompositions : 0
% 0.18/0.48 # Total rewrite steps : 0
% 0.18/0.48 # ...of those cached : 0
% 0.18/0.48 # Propositional unsat checks : 0
% 0.18/0.48 # Propositional check models : 0
% 0.18/0.48 # Propositional check unsatisfiable : 0
% 0.18/0.48 # Propositional clauses : 0
% 0.18/0.48 # Propositional clauses after purity: 0
% 0.18/0.48 # Propositional unsat core size : 0
% 0.18/0.48 # Propositional preprocessing time : 0.000
% 0.18/0.48 # Propositional encoding time : 0.000
% 0.18/0.48 # Propositional solver time : 0.000
% 0.18/0.48 # Success case prop preproc time : 0.000
% 0.18/0.48 # Success case prop encoding time : 0.000
% 0.18/0.48 # Success case prop solver time : 0.000
% 0.18/0.48 # Current number of processed clauses : 4
% 0.18/0.48 # Positive orientable unit clauses : 2
% 0.18/0.48 # Positive unorientable unit clauses: 0
% 0.18/0.48 # Negative unit clauses : 1
% 0.18/0.48 # Non-unit-clauses : 1
% 0.18/0.48 # Current number of unprocessed clauses: 12
% 0.18/0.48 # ...number of literals in the above : 40
% 0.18/0.48 # Current number of archived formulas : 0
% 0.18/0.48 # Current number of archived clauses : 16
% 0.18/0.48 # Clause-clause subsumption calls (NU) : 106
% 0.18/0.48 # Rec. Clause-clause subsumption calls : 46
% 0.18/0.48 # Non-unit clause-clause subsumptions : 0
% 0.18/0.48 # Unit Clause-clause subsumption calls : 0
% 0.18/0.48 # Rewrite failures with RHS unbound : 0
% 0.18/0.48 # BW rewrite match attempts : 0
% 0.18/0.48 # BW rewrite match successes : 0
% 0.18/0.48 # Condensation attempts : 20
% 0.18/0.48 # Condensation successes : 0
% 0.18/0.48 # Termbank termtop insertions : 3890
% 0.18/0.48 # Search garbage collected termcells : 1296
% 0.18/0.48
% 0.18/0.48 # -------------------------------------------------
% 0.18/0.48 # User time : 0.004 s
% 0.18/0.48 # System time : 0.007 s
% 0.18/0.48 # Total time : 0.011 s
% 0.18/0.48 # Maximum resident set size: 2096 pages
% 0.18/0.48
% 0.18/0.48 # -------------------------------------------------
% 0.18/0.48 # User time : 0.007 s
% 0.18/0.48 # System time : 0.010 s
% 0.18/0.48 # Total time : 0.016 s
% 0.18/0.48 # Maximum resident set size: 1792 pages
% 0.18/0.48 % E---3.1 exiting
% 0.18/0.49 % E exiting
%------------------------------------------------------------------------------