TSTP Solution File: SYO068^4.001 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO068^4.001 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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 08:44:31 EDT 2024
% Result : Theorem 0.19s 0.47s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 24
% Syntax : Number of formulae : 48 ( 27 unt; 13 typ; 0 def)
% Number of atoms : 106 ( 16 equ; 0 cnn)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 209 ( 30 ~; 31 |; 3 &; 135 @)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 57 ( 57 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 13 usr; 2 con; 0-3 aty)
% Number of variables : 66 ( 34 ^ 32 !; 0 ?; 66 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
irel: $i > $i > $o ).
thf(decl_23,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_24,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_26,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_27,type,
mbox_s4: ( $i > $o ) > $i > $o ).
thf(decl_28,type,
iatom: ( $i > $o ) > $i > $o ).
thf(decl_34,type,
iimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_38,type,
ivalid: ( $i > $o ) > $o ).
thf(decl_42,type,
p0: $i > $o ).
thf(decl_43,type,
p1: $i > $o ).
thf(decl_44,type,
esk1_1: $i > $i ).
thf(decl_45,type,
esk2_2: $i > $i > $i ).
thf(decl_46,type,
esk3_0: $i ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X10: $i > $o,X11: $i > $o] : ( mor @ ( mnot @ X10 ) @ X11 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL010^0.ax',mimplies) ).
thf(mnot,axiom,
( mnot
= ( ^ [X4: $i > $o,X5: $i] :
~ ( X4 @ X5 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL010^0.ax',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X6: $i > $o,X7: $i > $o,X5: $i] :
( ( X6 @ X5 )
| ( X7 @ X5 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL010^0.ax',mor) ).
thf(iimplies,axiom,
( iimplies
= ( ^ [X12: $i > $o,X14: $i > $o] : ( mimplies @ ( mbox_s4 @ X12 ) @ ( mbox_s4 @ X14 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL010^0.ax',iimplies) ).
thf(mbox_s4,axiom,
( mbox_s4
= ( ^ [X12: $i > $o,X1: $i] :
! [X2: $i] :
( ( irel @ X1 @ X2 )
=> ( X12 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL010^0.ax',mbox_s4) ).
thf(iatom,axiom,
( iatom
= ( ^ [X12: $i > $o] : X12 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL010^0.ax',iatom) ).
thf(ivalid,axiom,
( ivalid
= ( ^ [X15: $i > $o] :
! [X13: $i] : ( X15 @ X13 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL010^0.ax',ivalid) ).
thf(axiom2,axiom,
ivalid @ ( iimplies @ ( iatom @ p1 ) @ ( iimplies @ ( iatom @ p1 ) @ ( iatom @ p0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom2) ).
thf(axiom1,axiom,
ivalid @ ( iatom @ p1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom1) ).
thf(refl_axiom,axiom,
! [X1: $i] : ( irel @ X1 @ X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL010^0.ax',refl_axiom) ).
thf(con,conjecture,
ivalid @ ( iatom @ p0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
thf(c_0_11,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
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,
( iimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ! [X24: $i] :
( ( irel @ Z2 @ X24 )
=> ( Z0 @ X24 ) )
| ! [X25: $i] :
( ( irel @ Z2 @ X25 )
=> ( Z1 @ X25 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[iimplies]) ).
thf(c_0_15,plain,
( mimplies
= ( ^ [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_16,plain,
( mbox_s4
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X2: $i] :
( ( irel @ Z1 @ X2 )
=> ( Z0 @ X2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_s4]) ).
thf(c_0_17,plain,
( iatom
= ( ^ [Z0: $i > $o] : Z0 ) ),
inference(fof_simplification,[status(thm)],[iatom]) ).
thf(c_0_18,plain,
( iimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ! [X24: $i] :
( ( irel @ Z2 @ X24 )
=> ( Z0 @ X24 ) )
| ! [X25: $i] :
( ( irel @ Z2 @ 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_19,plain,
( ivalid
= ( ^ [Z0: $i > $o] :
! [X13: $i] : ( Z0 @ X13 ) ) ),
inference(fof_simplification,[status(thm)],[ivalid]) ).
thf(c_0_20,plain,
! [X42: $i] :
( ~ ! [X40: $i] :
( ( irel @ X42 @ X40 )
=> ( p1 @ X40 ) )
| ! [X41: $i] :
( ( irel @ X42 @ X41 )
=> ( ~ ! [X38: $i] :
( ( irel @ X41 @ X38 )
=> ( p1 @ X38 ) )
| ! [X39: $i] :
( ( irel @ X41 @ X39 )
=> ( p0 @ X39 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axiom2,c_0_17]),c_0_18]),c_0_19]) ).
thf(c_0_21,plain,
! [X37: $i] : ( p1 @ X37 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axiom1,c_0_17]),c_0_19]) ).
thf(c_0_22,plain,
! [X49: $i,X51: $i,X53: $i] :
( ( ( irel @ X51 @ ( esk2_2 @ X49 @ X51 ) )
| ~ ( irel @ X51 @ X53 )
| ( p0 @ X53 )
| ~ ( irel @ X49 @ X51 )
| ( irel @ X49 @ ( esk1_1 @ X49 ) ) )
& ( ~ ( p1 @ ( esk2_2 @ X49 @ X51 ) )
| ~ ( irel @ X51 @ X53 )
| ( p0 @ X53 )
| ~ ( irel @ X49 @ X51 )
| ( irel @ X49 @ ( esk1_1 @ X49 ) ) )
& ( ( irel @ X51 @ ( esk2_2 @ X49 @ X51 ) )
| ~ ( irel @ X51 @ X53 )
| ( p0 @ X53 )
| ~ ( irel @ X49 @ X51 )
| ~ ( p1 @ ( esk1_1 @ X49 ) ) )
& ( ~ ( p1 @ ( esk2_2 @ X49 @ X51 ) )
| ~ ( irel @ X51 @ X53 )
| ( p0 @ X53 )
| ~ ( irel @ X49 @ X51 )
| ~ ( p1 @ ( esk1_1 @ X49 ) ) ) ),
inference(distribute,[status(thm)],[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_20])])])])])]) ).
thf(c_0_23,plain,
! [X48: $i] : ( p1 @ X48 ),
inference(variable_rename,[status(thm)],[c_0_21]) ).
thf(c_0_24,plain,
! [X3: $i,X2: $i,X1: $i] :
( ( p0 @ X3 )
| ~ ( p1 @ ( esk2_2 @ X1 @ X2 ) )
| ~ ( irel @ X2 @ X3 )
| ~ ( irel @ X1 @ X2 )
| ~ ( p1 @ ( esk1_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_25,plain,
! [X1: $i] : ( p1 @ X1 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_26,plain,
! [X44: $i] : ( irel @ X44 @ X44 ),
inference(variable_rename,[status(thm)],[refl_axiom]) ).
thf(c_0_27,negated_conjecture,
~ ! [X43: $i] : ( p0 @ X43 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[con]),c_0_17]),c_0_19]) ).
thf(c_0_28,plain,
! [X1: $i,X3: $i,X2: $i] :
( ( p0 @ X1 )
| ~ ( irel @ X2 @ X1 )
| ~ ( irel @ X3 @ X2 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_25])]) ).
thf(c_0_29,plain,
! [X1: $i] : ( irel @ X1 @ X1 ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_30,negated_conjecture,
~ ( p0 @ esk3_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])])])]) ).
thf(c_0_31,plain,
! [X2: $i,X1: $i] :
( ( p0 @ X1 )
| ~ ( irel @ X2 @ X1 ) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
thf(c_0_32,negated_conjecture,
~ ( p0 @ esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
thf(c_0_33,plain,
! [X1: $i] : ( p0 @ X1 ),
inference(spm,[status(thm)],[c_0_31,c_0_29]) ).
thf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SYO068^4.001 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n024.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon May 20 10:41:37 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.19/0.46 Running higher-order theorem proving
% 0.19/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.19/0.47 # Version: 3.1.0-ho
% 0.19/0.47 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.19/0.47 # Starting post_as_ho3 with 300s (1) cores
% 0.19/0.47 # Starting post_as_ho11 with 300s (1) cores
% 0.19/0.47 # Starting full_lambda_8 with 300s (1) cores
% 0.19/0.47 # post_as_ho11 with pid 26243 completed with status 0
% 0.19/0.47 # Result found by post_as_ho11
% 0.19/0.47 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.19/0.47 # Starting post_as_ho3 with 300s (1) cores
% 0.19/0.47 # Starting post_as_ho11 with 300s (1) cores
% 0.19/0.47 # No SInE strategy applied
% 0.19/0.47 # Search class: HGUNS-FFSF21-SHSSMFNN
% 0.19/0.47 # partial match(1): HGUNS-FFMF21-SHSSMFNN
% 0.19/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.47 # new_ho_10 with pid 26248 completed with status 0
% 0.19/0.47 # Result found by new_ho_10
% 0.19/0.47 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.19/0.47 # Starting post_as_ho3 with 300s (1) cores
% 0.19/0.47 # Starting post_as_ho11 with 300s (1) cores
% 0.19/0.47 # No SInE strategy applied
% 0.19/0.47 # Search class: HGUNS-FFSF21-SHSSMFNN
% 0.19/0.47 # partial match(1): HGUNS-FFMF21-SHSSMFNN
% 0.19/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.47 # Preprocessing time : 0.001 s
% 0.19/0.47 # Presaturation interreduction done
% 0.19/0.47
% 0.19/0.47 # Proof found!
% 0.19/0.47 # SZS status Theorem
% 0.19/0.47 # SZS output start CNFRefutation
% See solution above
% 0.19/0.47 # Parsed axioms : 46
% 0.19/0.47 # Removed by relevancy pruning/SinE : 0
% 0.19/0.47 # Initial clauses : 30
% 0.19/0.47 # Removed in clause preprocessing : 22
% 0.19/0.47 # Initial clauses in saturation : 8
% 0.19/0.47 # Processed clauses : 14
% 0.19/0.47 # ...of these trivial : 0
% 0.19/0.47 # ...subsumed : 3
% 0.19/0.47 # ...remaining for further processing : 11
% 0.19/0.47 # Other redundant clauses eliminated : 0
% 0.19/0.47 # Clauses deleted for lack of memory : 0
% 0.19/0.47 # Backward-subsumed : 1
% 0.19/0.47 # Backward-rewritten : 2
% 0.19/0.47 # Generated clauses : 2
% 0.19/0.47 # ...of the previous two non-redundant : 2
% 0.19/0.47 # ...aggressively subsumed : 0
% 0.19/0.47 # Contextual simplify-reflections : 0
% 0.19/0.47 # Paramodulations : 2
% 0.19/0.47 # Factorizations : 0
% 0.19/0.47 # NegExts : 0
% 0.19/0.47 # Equation resolutions : 0
% 0.19/0.47 # Disequality decompositions : 0
% 0.19/0.47 # Total rewrite steps : 6
% 0.19/0.47 # ...of those cached : 1
% 0.19/0.47 # Propositional unsat checks : 0
% 0.19/0.47 # Propositional check models : 0
% 0.19/0.47 # Propositional check unsatisfiable : 0
% 0.19/0.47 # Propositional clauses : 0
% 0.19/0.47 # Propositional clauses after purity: 0
% 0.19/0.47 # Propositional unsat core size : 0
% 0.19/0.47 # Propositional preprocessing time : 0.000
% 0.19/0.47 # Propositional encoding time : 0.000
% 0.19/0.47 # Propositional solver time : 0.000
% 0.19/0.47 # Success case prop preproc time : 0.000
% 0.19/0.47 # Success case prop encoding time : 0.000
% 0.19/0.47 # Success case prop solver time : 0.000
% 0.19/0.47 # Current number of processed clauses : 3
% 0.19/0.47 # Positive orientable unit clauses : 3
% 0.19/0.47 # Positive unorientable unit clauses: 0
% 0.19/0.47 # Negative unit clauses : 0
% 0.19/0.47 # Non-unit-clauses : 0
% 0.19/0.47 # Current number of unprocessed clauses: 1
% 0.19/0.47 # ...number of literals in the above : 3
% 0.19/0.47 # Current number of archived formulas : 0
% 0.19/0.47 # Current number of archived clauses : 8
% 0.19/0.47 # Clause-clause subsumption calls (NU) : 13
% 0.19/0.47 # Rec. Clause-clause subsumption calls : 12
% 0.19/0.47 # Non-unit clause-clause subsumptions : 4
% 0.19/0.47 # Unit Clause-clause subsumption calls : 0
% 0.19/0.47 # Rewrite failures with RHS unbound : 0
% 0.19/0.47 # BW rewrite match attempts : 2
% 0.19/0.47 # BW rewrite match successes : 2
% 0.19/0.47 # Condensation attempts : 14
% 0.19/0.47 # Condensation successes : 0
% 0.19/0.47 # Termbank termtop insertions : 1918
% 0.19/0.47 # Search garbage collected termcells : 534
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.004 s
% 0.19/0.47 # System time : 0.001 s
% 0.19/0.47 # Total time : 0.006 s
% 0.19/0.47 # Maximum resident set size: 1896 pages
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.005 s
% 0.19/0.47 # System time : 0.004 s
% 0.19/0.47 # Total time : 0.009 s
% 0.19/0.47 # Maximum resident set size: 1784 pages
% 0.19/0.47 % E---3.1 exiting
% 0.19/0.47 % E exiting
%------------------------------------------------------------------------------