TSTP Solution File: SWV435^3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWV435^3 : TPTP v8.2.0. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:46 EDT 2024
% Result : Theorem 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 26
% Syntax : Number of formulae : 46 ( 26 unt; 14 typ; 0 def)
% Number of atoms : 84 ( 23 equ; 0 cnn)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 72 ( 11 ~; 8 |; 3 &; 44 @)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 53 ( 53 >; 0 *; 0 +; 0 <<)
% Number of symbols : 17 ( 14 usr; 4 con; 0-3 aty)
% Number of variables : 49 ( 35 ^ 14 !; 0 ?; 49 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_26,type,
mfalse: $i > $o ).
thf(decl_27,type,
mtrue: $i > $o ).
thf(decl_29,type,
mor: ( $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_47,type,
icl_true: $i > $o ).
thf(decl_48,type,
icl_false: $i > $o ).
thf(decl_49,type,
icl_says: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_50,type,
iclval: ( $i > $o ) > $o ).
thf(decl_51,type,
a: $i > $o ).
thf(decl_52,type,
esk1_0: $i ).
thf(decl_53,type,
esk2_0: $i ).
thf(mtrue,axiom,
( mtrue
= ( ^ [X1: $i] : $true ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mtrue) ).
thf(mfalse,axiom,
( mfalse
= ( ^ [X1: $i] : ~ $true ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mfalse) ).
thf(icl_says,axiom,
( icl_says
= ( ^ [X19: $i > $o,X21: $i > $o] : ( mbox @ rel @ ( mor @ X19 @ X21 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV008^0.ax',icl_says) ).
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(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_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_princ,axiom,
( icl_princ
= ( ^ [X11: $i > $o] : X11 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV008^0.ax',icl_princ) ).
thf(icl_true,axiom,
( icl_true
= ( ^ [Z0: $i] : $true ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV008^0.ax',icl_true) ).
thf(icl_false,axiom,
( icl_false
= ( ^ [Z0: $i] : ~ $true ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV008^0.ax',icl_false) ).
thf(ax1,axiom,
( ( icl_princ @ a )
= icl_true ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).
thf(untrust,conjecture,
iclval @ ( icl_says @ ( icl_princ @ a ) @ icl_false ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',untrust) ).
thf(c_0_12,plain,
( mtrue
= ( ^ [Z0: $i] : $true ) ),
inference(fof_simplification,[status(thm)],[mtrue]) ).
thf(c_0_13,plain,
( mfalse
= ( ^ [Z0: $i] : ~ $true ) ),
inference(fof_simplification,[status(thm)],[mfalse]) ).
thf(c_0_14,plain,
( icl_says
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
! [X25: $i] :
( ( rel @ Z2 @ X25 )
=> ( ( Z0 @ X25 )
| ( Z1 @ X25 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[icl_says]) ).
thf(c_0_15,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
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,
( iclval
= ( ^ [Z0: $i > $o] :
! [X26: $i] : ( Z0 @ X26 ) ) ),
inference(fof_simplification,[status(thm)],[icl_s4_valid]) ).
thf(c_0_18,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X15: $i] : ( Z0 @ X15 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_19,plain,
( icl_princ
= ( ^ [Z0: $i > $o] : Z0 ) ),
inference(fof_simplification,[status(thm)],[icl_princ]) ).
thf(c_0_20,axiom,
( icl_true
= ( ^ [Z0: $i] : $true ) ),
inference(apply_def,[status(thm)],[icl_true,c_0_12]) ).
thf(c_0_21,axiom,
( icl_false
= ( ^ [Z0: $i] : ~ $true ) ),
inference(apply_def,[status(thm)],[icl_false,c_0_13]) ).
thf(c_0_22,plain,
( icl_says
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
! [X25: $i] :
( ( rel @ Z2 @ X25 )
=> ( ( Z0 @ X25 )
| ( Z1 @ X25 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
thf(c_0_23,plain,
( iclval
= ( ^ [Z0: $i > $o] :
! [X26: $i] : ( Z0 @ X26 ) ) ),
inference(apply_def,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_24,plain,
! [X29: $i] :
( ( a @ X29 )
<=> $true ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[ax1,c_0_19]),c_0_20])]) ).
thf(c_0_25,negated_conjecture,
~ ! [X28: $i,X27: $i] :
( ( rel @ X28 @ X27 )
=> ( ( a @ X27 )
| ~ $true ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[untrust]),c_0_19]),c_0_21]),c_0_22]),c_0_23]) ).
thf(c_0_26,plain,
! [X30: $i] :
( ( ~ ( a @ X30 )
| $true )
& ( ~ $true
| ( a @ X30 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])]) ).
thf(c_0_27,negated_conjecture,
( ( rel @ esk1_0 @ esk2_0 )
& ~ ( a @ esk2_0 )
& $true ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])]) ).
thf(c_0_28,plain,
! [X1: $i] :
( ( a @ X1 )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_29,negated_conjecture,
~ ( a @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_30,plain,
! [X1: $i] : ( a @ X1 ),
inference(cn,[status(thm)],[c_0_28]) ).
thf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWV435^3 : TPTP v8.2.0. Released v3.6.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n019.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 09:33:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running higher-order theorem proving
% 0.21/0.49 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.21/0.50 # Version: 3.1.0-ho
% 0.21/0.50 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.50 # Starting post_as_ho3 with 300s (1) cores
% 0.21/0.50 # Starting post_as_ho11 with 300s (1) cores
% 0.21/0.50 # Starting full_lambda_8 with 300s (1) cores
% 0.21/0.50 # post_as_ho3 with pid 13993 completed with status 0
% 0.21/0.50 # Result found by post_as_ho3
% 0.21/0.50 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.50 # Starting post_as_ho3 with 300s (1) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: HUUNF-FFSF00-SHSSMFNN
% 0.21/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.50 # new_ho_10 with pid 13999 completed with status 0
% 0.21/0.50 # Result found by new_ho_10
% 0.21/0.50 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.50 # Starting post_as_ho3 with 300s (1) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: HUUNF-FFSF00-SHSSMFNN
% 0.21/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Theorem
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 57
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 36
% 0.21/0.50 # Removed in clause preprocessing : 33
% 0.21/0.50 # Initial clauses in saturation : 3
% 0.21/0.50 # Processed clauses : 3
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 0
% 0.21/0.50 # ...remaining for further processing : 3
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 0
% 0.21/0.50 # Backward-rewritten : 1
% 0.21/0.50 # Generated clauses : 0
% 0.21/0.50 # ...of the previous two non-redundant : 0
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 0
% 0.21/0.50 # Paramodulations : 0
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 1
% 0.21/0.50 # ...of those cached : 0
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 2
% 0.21/0.50 # Positive orientable unit clauses : 2
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 0
% 0.21/0.50 # Non-unit-clauses : 0
% 0.21/0.50 # Current number of unprocessed clauses: 0
% 0.21/0.50 # ...number of literals in the above : 0
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 1
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.50 # Non-unit clause-clause subsumptions : 0
% 0.21/0.50 # Unit Clause-clause subsumption calls : 0
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 1
% 0.21/0.50 # BW rewrite match successes : 1
% 0.21/0.50 # Condensation attempts : 3
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 1292
% 0.21/0.50 # Search garbage collected termcells : 203
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.005 s
% 0.21/0.50 # System time : 0.000 s
% 0.21/0.50 # Total time : 0.005 s
% 0.21/0.50 # Maximum resident set size: 1884 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.007 s
% 0.21/0.50 # System time : 0.003 s
% 0.21/0.50 # Total time : 0.010 s
% 0.21/0.50 # Maximum resident set size: 1776 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.51 % E exiting
%------------------------------------------------------------------------------