TSTP Solution File: SWV429^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWV429^2 : TPTP v8.2.0. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:45 EDT 2024
% Result : Theorem 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 21
% Syntax : Number of formulae : 37 ( 22 unt; 12 typ; 0 def)
% Number of atoms : 61 ( 19 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 75 ( 10 ~; 7 |; 2 &; 51 @)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 65 ( 65 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 3 con; 0-3 aty)
% Number of variables : 49 ( 39 ^ 10 !; 0 ?; 49 :)
% 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,
rel: $i > $i > $o ).
thf(decl_43,type,
icl_princ: ( $i > $o ) > $i > $o ).
thf(decl_50,type,
iclval: ( $i > $o ) > $o ).
thf(decl_51,type,
icl_impl_princ: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_52,type,
a: $i > $o ).
thf(decl_55,type,
esk3_0: $i ).
thf(decl_56,type,
esk4_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(icl_s4_valid,axiom,
( iclval
= ( ^ [X22: $i > $o] : ( mvalid @ X22 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV008^0.ax',icl_s4_valid) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X11: $i > $o] :
! [X15: $i] : ( X11 @ X15 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mvalid) ).
thf(icl_impl_princ,axiom,
( icl_impl_princ
= ( ^ [X19: $i > $o,X20: $i > $o] : ( mbox @ rel @ ( mimpl @ X19 @ X20 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV008^2.ax',icl_impl_princ) ).
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(icl_princ,axiom,
( icl_princ
= ( ^ [X11: $i > $o] : X11 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV008^0.ax',icl_princ) ).
thf(conj,conjecture,
iclval @ ( icl_impl_princ @ ( icl_princ @ a ) @ ( icl_princ @ a ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(c_0_9,plain,
( mimpl
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimpl]) ).
thf(c_0_10,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_11,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_12,plain,
( iclval
= ( ^ [Z0: $i > $o] :
! [X28: $i] : ( Z0 @ X28 ) ) ),
inference(fof_simplification,[status(thm)],[icl_s4_valid]) ).
thf(c_0_13,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X15: $i] : ( Z0 @ X15 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_14,plain,
( icl_impl_princ
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
! [X29: $i] :
( ( rel @ Z2 @ X29 )
=> ( ~ ( Z0 @ X29 )
| ( Z1 @ X29 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[icl_impl_princ]) ).
thf(c_0_15,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_9,c_0_10]),c_0_11]) ).
thf(c_0_16,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_17,plain,
( icl_princ
= ( ^ [Z0: $i > $o] : Z0 ) ),
inference(fof_simplification,[status(thm)],[icl_princ]) ).
thf(c_0_18,plain,
( iclval
= ( ^ [Z0: $i > $o] :
! [X28: $i] : ( Z0 @ X28 ) ) ),
inference(apply_def,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_19,plain,
( icl_impl_princ
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
! [X29: $i] :
( ( rel @ Z2 @ X29 )
=> ( ~ ( Z0 @ X29 )
| ( Z1 @ X29 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
thf(c_0_20,negated_conjecture,
~ ! [X37: $i,X36: $i] :
( ( rel @ X37 @ X36 )
=> ( ~ ( a @ X36 )
| ( a @ X36 ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj]),c_0_17]),c_0_18]),c_0_19])]) ).
thf(c_0_21,negated_conjecture,
( ( rel @ esk3_0 @ esk4_0 )
& ( a @ esk4_0 )
& ~ ( a @ esk4_0 ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])]) ).
thf(c_0_22,negated_conjecture,
~ ( a @ esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_23,negated_conjecture,
a @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV429^2 : TPTP v8.2.0. Released v3.6.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n002.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 : Sun May 19 08:10:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running higher-order theorem proving
% 0.19/0.47 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.19/0.49 # Version: 3.1.0-ho
% 0.19/0.49 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.19/0.49 # Starting post_as_ho3 with 300s (1) cores
% 0.19/0.49 # Starting post_as_ho11 with 300s (1) cores
% 0.19/0.49 # Starting full_lambda_8 with 300s (1) cores
% 0.19/0.49 # post_as_ho11 with pid 25835 completed with status 0
% 0.19/0.49 # Result found by post_as_ho11
% 0.19/0.49 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.19/0.49 # Starting post_as_ho3 with 300s (1) cores
% 0.19/0.49 # Starting post_as_ho11 with 300s (1) cores
% 0.19/0.49 # No SInE strategy applied
% 0.19/0.49 # Search class: HGUNF-FFSF22-SHSSMMBN
% 0.19/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.49 # new_ho_10 with pid 25839 completed with status 0
% 0.19/0.49 # Result found by new_ho_10
% 0.19/0.49 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.19/0.49 # Starting post_as_ho3 with 300s (1) cores
% 0.19/0.49 # Starting post_as_ho11 with 300s (1) cores
% 0.19/0.49 # No SInE strategy applied
% 0.19/0.49 # Search class: HGUNF-FFSF22-SHSSMMBN
% 0.19/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.49 # Preprocessing time : 0.001 s
% 0.19/0.49 # Presaturation interreduction done
% 0.19/0.49
% 0.19/0.49 # Proof found!
% 0.19/0.49 # SZS status Theorem
% 0.19/0.49 # SZS output start CNFRefutation
% See solution above
% 0.19/0.49 # Parsed axioms : 60
% 0.19/0.49 # Removed by relevancy pruning/SinE : 0
% 0.19/0.49 # Initial clauses : 39
% 0.19/0.49 # Removed in clause preprocessing : 32
% 0.19/0.49 # Initial clauses in saturation : 7
% 0.19/0.49 # Processed clauses : 2
% 0.19/0.49 # ...of these trivial : 0
% 0.19/0.49 # ...subsumed : 0
% 0.19/0.49 # ...remaining for further processing : 1
% 0.19/0.49 # Other redundant clauses eliminated : 0
% 0.19/0.49 # Clauses deleted for lack of memory : 0
% 0.19/0.49 # Backward-subsumed : 0
% 0.19/0.49 # Backward-rewritten : 0
% 0.19/0.49 # Generated clauses : 0
% 0.19/0.49 # ...of the previous two non-redundant : 0
% 0.19/0.49 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 0
% 0.19/0.49 # Paramodulations : 0
% 0.19/0.49 # Factorizations : 0
% 0.19/0.49 # NegExts : 0
% 0.19/0.49 # Equation resolutions : 0
% 0.19/0.49 # Disequality decompositions : 0
% 0.19/0.49 # Total rewrite steps : 1
% 0.19/0.49 # ...of those cached : 0
% 0.19/0.49 # Propositional unsat checks : 0
% 0.19/0.49 # Propositional check models : 0
% 0.19/0.49 # Propositional check unsatisfiable : 0
% 0.19/0.49 # Propositional clauses : 0
% 0.19/0.49 # Propositional clauses after purity: 0
% 0.19/0.49 # Propositional unsat core size : 0
% 0.19/0.49 # Propositional preprocessing time : 0.000
% 0.19/0.49 # Propositional encoding time : 0.000
% 0.19/0.49 # Propositional solver time : 0.000
% 0.19/0.49 # Success case prop preproc time : 0.000
% 0.19/0.49 # Success case prop encoding time : 0.000
% 0.19/0.49 # Success case prop solver time : 0.000
% 0.19/0.49 # Current number of processed clauses : 1
% 0.19/0.49 # Positive orientable unit clauses : 1
% 0.19/0.49 # Positive unorientable unit clauses: 0
% 0.19/0.49 # Negative unit clauses : 0
% 0.19/0.49 # Non-unit-clauses : 0
% 0.19/0.49 # Current number of unprocessed clauses: 5
% 0.19/0.49 # ...number of literals in the above : 13
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 0
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.49 # Non-unit clause-clause subsumptions : 0
% 0.19/0.49 # Unit Clause-clause subsumption calls : 0
% 0.19/0.49 # Rewrite failures with RHS unbound : 0
% 0.19/0.49 # BW rewrite match attempts : 0
% 0.19/0.49 # BW rewrite match successes : 0
% 0.19/0.49 # Condensation attempts : 2
% 0.19/0.49 # Condensation successes : 0
% 0.19/0.49 # Termbank termtop insertions : 1772
% 0.19/0.49 # Search garbage collected termcells : 456
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.005 s
% 0.19/0.49 # System time : 0.001 s
% 0.19/0.49 # Total time : 0.006 s
% 0.19/0.49 # Maximum resident set size: 1892 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.008 s
% 0.19/0.49 # System time : 0.003 s
% 0.19/0.49 # Total time : 0.011 s
% 0.19/0.49 # Maximum resident set size: 1780 pages
% 0.19/0.49 % E---3.1 exiting
% 0.19/0.49 % E exiting
%------------------------------------------------------------------------------