TSTP Solution File: SEU598^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU598^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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 03:28:28 EDT 2024
% Result : Theorem 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 17
% Syntax : Number of formulae : 33 ( 5 unt; 11 typ; 0 def)
% Number of atoms : 83 ( 8 equ; 0 cnn)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 267 ( 22 ~; 21 |; 7 &; 184 @)
% ( 5 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 9 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 63 ( 0 ^ 63 !; 0 ?; 63 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
subset: $i > $i > $o ).
thf(decl_24,type,
subsetI1: $o ).
thf(decl_25,type,
subsetE: $o ).
thf(decl_26,type,
setextsub: $o ).
thf(decl_27,type,
binintersect: $i > $i > $i ).
thf(decl_28,type,
binintersectI: $o ).
thf(decl_29,type,
binintersectRsub: $o ).
thf(decl_30,type,
esk1_2: $i > $i > $i ).
thf(decl_31,type,
esk2_0: $i ).
thf(decl_32,type,
esk3_0: $i ).
thf(binintersectSubset4,conjecture,
( subsetI1
=> ( subsetE
=> ( setextsub
=> ( binintersectI
=> ( binintersectRsub
=> ! [X1: $i,X2: $i] :
( ( subset @ X2 @ X1 )
=> ( ( binintersect @ X1 @ X2 )
= X2 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binintersectSubset4) ).
thf(subsetI1,axiom,
( subsetI1
<=> ! [X1: $i,X2: $i] :
( ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( in @ X3 @ X2 ) )
=> ( subset @ X1 @ X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsetI1) ).
thf(subsetE,axiom,
( subsetE
<=> ! [X1: $i,X2: $i,X3: $i] :
( ( subset @ X1 @ X2 )
=> ( ( in @ X3 @ X1 )
=> ( in @ X3 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsetE) ).
thf(setextsub,axiom,
( setextsub
<=> ! [X1: $i,X2: $i] :
( ( subset @ X1 @ X2 )
=> ( ( subset @ X2 @ X1 )
=> ( X1 = X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setextsub) ).
thf(binintersectI,axiom,
( binintersectI
<=> ! [X1: $i,X2: $i,X3: $i] :
( ( in @ X3 @ X1 )
=> ( ( in @ X3 @ X2 )
=> ( in @ X3 @ ( binintersect @ X1 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binintersectI) ).
thf(binintersectRsub,axiom,
( binintersectRsub
<=> ! [X1: $i,X2: $i] : ( subset @ ( binintersect @ X1 @ X2 ) @ X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binintersectRsub) ).
thf(c_0_6,negated_conjecture,
~ ( ! [X19: $i,X20: $i] :
( ! [X21: $i] :
( ( in @ X21 @ X19 )
=> ( in @ X21 @ X20 ) )
=> ( subset @ X19 @ X20 ) )
=> ( ! [X22: $i,X23: $i,X24: $i] :
( ( subset @ X22 @ X23 )
=> ( ( in @ X24 @ X22 )
=> ( in @ X24 @ X23 ) ) )
=> ( ! [X25: $i,X26: $i] :
( ( subset @ X25 @ X26 )
=> ( ( subset @ X26 @ X25 )
=> ( X25 = X26 ) ) )
=> ( ! [X27: $i,X28: $i,X29: $i] :
( ( in @ X29 @ X27 )
=> ( ( in @ X29 @ X28 )
=> ( in @ X29 @ ( binintersect @ X27 @ X28 ) ) ) )
=> ( ! [X30: $i,X31: $i] : ( subset @ ( binintersect @ X30 @ X31 ) @ X31 )
=> ! [X1: $i,X2: $i] :
( ( subset @ X2 @ X1 )
=> ( ( binintersect @ X1 @ X2 )
= X2 ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[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)],[binintersectSubset4]),subsetI1]),subsetE]),setextsub]),binintersectI]),binintersectRsub]) ).
thf(c_0_7,negated_conjecture,
! [X32: $i,X33: $i,X35: $i,X36: $i,X37: $i,X38: $i,X39: $i,X40: $i,X41: $i,X42: $i,X43: $i,X44: $i] :
( ( ( in @ ( esk1_2 @ X32 @ X33 ) @ X32 )
| ( subset @ X32 @ X33 ) )
& ( ~ ( in @ ( esk1_2 @ X32 @ X33 ) @ X33 )
| ( subset @ X32 @ X33 ) )
& ( ~ ( subset @ X35 @ X36 )
| ~ ( in @ X37 @ X35 )
| ( in @ X37 @ X36 ) )
& ( ~ ( subset @ X38 @ X39 )
| ~ ( subset @ X39 @ X38 )
| ( X38 = X39 ) )
& ( ~ ( in @ X42 @ X40 )
| ~ ( in @ X42 @ X41 )
| ( in @ X42 @ ( binintersect @ X40 @ X41 ) ) )
& ( subset @ ( binintersect @ X43 @ X44 ) @ X44 )
& ( subset @ esk3_0 @ esk2_0 )
& ( ( binintersect @ esk2_0 @ esk3_0 )
!= esk3_0 ) ),
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_6])])])])])]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i,X2: $i] :
( ( subset @ X1 @ X2 )
| ~ ( in @ ( esk1_2 @ X1 @ X2 ) @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( in @ X1 @ ( binintersect @ X2 @ X3 ) )
| ~ ( in @ X1 @ X2 )
| ~ ( in @ X1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( subset @ X1 @ ( binintersect @ X2 @ X3 ) )
| ~ ( in @ ( esk1_2 @ X1 @ ( binintersect @ X2 @ X3 ) ) @ X3 )
| ~ ( in @ ( esk1_2 @ X1 @ ( binintersect @ X2 @ X3 ) ) @ X2 ) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_11,negated_conjecture,
! [X1: $i,X2: $i] :
( ( in @ ( esk1_2 @ X1 @ X2 ) @ X1 )
| ( subset @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_12,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( in @ X3 @ X2 )
| ~ ( subset @ X1 @ X2 )
| ~ ( in @ X3 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_13,negated_conjecture,
subset @ esk3_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i,X2: $i] :
( ( subset @ X1 @ ( binintersect @ X2 @ X1 ) )
| ~ ( in @ ( esk1_2 @ X1 @ ( binintersect @ X2 @ X1 ) ) @ X2 ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i] :
( ( in @ X1 @ esk2_0 )
| ~ ( in @ X1 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i] :
( ( subset @ X1 @ ( binintersect @ esk2_0 @ X1 ) )
| ~ ( in @ ( esk1_2 @ X1 @ ( binintersect @ esk2_0 @ X1 ) ) @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_17,negated_conjecture,
! [X2: $i,X1: $i] :
( ( X1 = X2 )
| ~ ( subset @ X1 @ X2 )
| ~ ( subset @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_18,negated_conjecture,
subset @ esk3_0 @ ( binintersect @ esk2_0 @ esk3_0 ),
inference(spm,[status(thm)],[c_0_16,c_0_11]) ).
thf(c_0_19,negated_conjecture,
! [X1: $i,X2: $i] : ( subset @ ( binintersect @ X1 @ X2 ) @ X2 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_20,negated_conjecture,
( ( binintersect @ esk2_0 @ esk3_0 )
!= esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU598^2 : TPTP v8.2.0. Released v3.7.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n011.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 18:20:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.46 Running higher-order theorem proving
% 0.20/0.46 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.20/0.48 # Version: 3.1.0-ho
% 0.20/0.48 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.20/0.48 # Starting post_as_ho8 with 300s (1) cores
% 0.20/0.48 # Starting post_as_ho3 with 300s (1) cores
% 0.20/0.48 # Starting post_as_ho2 with 300s (1) cores
% 0.20/0.48 # post_as_ho3 with pid 28310 completed with status 0
% 0.20/0.48 # Result found by post_as_ho3
% 0.20/0.48 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.20/0.48 # Starting post_as_ho8 with 300s (1) cores
% 0.20/0.48 # Starting post_as_ho3 with 300s (1) cores
% 0.20/0.48 # No SInE strategy applied
% 0.20/0.48 # Search class: HGUSF-FFSF22-SFFFMFNN
% 0.20/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.48 # new_ho_10 with pid 28315 completed with status 0
% 0.20/0.48 # Result found by new_ho_10
% 0.20/0.48 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.20/0.48 # Starting post_as_ho8 with 300s (1) cores
% 0.20/0.48 # Starting post_as_ho3 with 300s (1) cores
% 0.20/0.48 # No SInE strategy applied
% 0.20/0.48 # Search class: HGUSF-FFSF22-SFFFMFNN
% 0.20/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.48 # Preprocessing time : 0.001 s
% 0.20/0.48 # Presaturation interreduction done
% 0.20/0.48
% 0.20/0.48 # Proof found!
% 0.20/0.48 # SZS status Theorem
% 0.20/0.48 # SZS output start CNFRefutation
% See solution above
% 0.20/0.48 # Parsed axioms : 14
% 0.20/0.48 # Removed by relevancy pruning/SinE : 0
% 0.20/0.48 # Initial clauses : 16
% 0.20/0.48 # Removed in clause preprocessing : 8
% 0.20/0.48 # Initial clauses in saturation : 8
% 0.20/0.48 # Processed clauses : 37
% 0.20/0.48 # ...of these trivial : 0
% 0.20/0.48 # ...subsumed : 1
% 0.20/0.48 # ...remaining for further processing : 36
% 0.20/0.48 # Other redundant clauses eliminated : 0
% 0.20/0.48 # Clauses deleted for lack of memory : 0
% 0.20/0.48 # Backward-subsumed : 0
% 0.20/0.48 # Backward-rewritten : 1
% 0.20/0.48 # Generated clauses : 65
% 0.20/0.48 # ...of the previous two non-redundant : 49
% 0.20/0.48 # ...aggressively subsumed : 0
% 0.20/0.48 # Contextual simplify-reflections : 0
% 0.20/0.48 # Paramodulations : 65
% 0.20/0.48 # Factorizations : 0
% 0.20/0.48 # NegExts : 0
% 0.20/0.48 # Equation resolutions : 0
% 0.20/0.48 # Disequality decompositions : 0
% 0.20/0.48 # Total rewrite steps : 15
% 0.20/0.48 # ...of those cached : 6
% 0.20/0.48 # Propositional unsat checks : 0
% 0.20/0.48 # Propositional check models : 0
% 0.20/0.48 # Propositional check unsatisfiable : 0
% 0.20/0.48 # Propositional clauses : 0
% 0.20/0.48 # Propositional clauses after purity: 0
% 0.20/0.48 # Propositional unsat core size : 0
% 0.20/0.48 # Propositional preprocessing time : 0.000
% 0.20/0.48 # Propositional encoding time : 0.000
% 0.20/0.48 # Propositional solver time : 0.000
% 0.20/0.48 # Success case prop preproc time : 0.000
% 0.20/0.48 # Success case prop encoding time : 0.000
% 0.20/0.48 # Success case prop solver time : 0.000
% 0.20/0.48 # Current number of processed clauses : 27
% 0.20/0.48 # Positive orientable unit clauses : 7
% 0.20/0.48 # Positive unorientable unit clauses: 0
% 0.20/0.48 # Negative unit clauses : 1
% 0.20/0.48 # Non-unit-clauses : 19
% 0.20/0.48 # Current number of unprocessed clauses: 27
% 0.20/0.48 # ...number of literals in the above : 68
% 0.20/0.48 # Current number of archived formulas : 0
% 0.20/0.48 # Current number of archived clauses : 9
% 0.20/0.48 # Clause-clause subsumption calls (NU) : 95
% 0.20/0.48 # Rec. Clause-clause subsumption calls : 88
% 0.20/0.48 # Non-unit clause-clause subsumptions : 1
% 0.20/0.48 # Unit Clause-clause subsumption calls : 8
% 0.20/0.48 # Rewrite failures with RHS unbound : 0
% 0.20/0.48 # BW rewrite match attempts : 12
% 0.20/0.48 # BW rewrite match successes : 1
% 0.20/0.48 # Condensation attempts : 37
% 0.20/0.48 # Condensation successes : 0
% 0.20/0.48 # Termbank termtop insertions : 2183
% 0.20/0.48 # Search garbage collected termcells : 397
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.006 s
% 0.20/0.48 # System time : 0.001 s
% 0.20/0.48 # Total time : 0.007 s
% 0.20/0.48 # Maximum resident set size: 1700 pages
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.007 s
% 0.20/0.48 # System time : 0.003 s
% 0.20/0.48 # Total time : 0.011 s
% 0.20/0.48 # Maximum resident set size: 1700 pages
% 0.20/0.48 % E---3.1 exiting
% 0.20/0.48 % E exiting
%------------------------------------------------------------------------------