TSTP Solution File: SEU594^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU594^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:26 EDT 2024
% Result : Theorem 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of formulae : 27 ( 6 unt; 10 typ; 0 def)
% Number of atoms : 72 ( 15 equ; 0 cnn)
% Maximal formula atoms : 17 ( 4 avg)
% Number of connectives : 189 ( 15 ~; 14 |; 6 &; 130 @)
% ( 5 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 11 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 58 ( 13 ^ 45 !; 0 ?; 58 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(decl_24,type,
in__Cong: $o ).
thf(decl_25,type,
subset: $i > $i > $o ).
thf(decl_26,type,
subsetI1: $o ).
thf(decl_27,type,
binintersect: $i > $i > $i ).
thf(decl_28,type,
binintersectEL: $o ).
thf(decl_29,type,
esk1_2: $i > $i > $i ).
thf(decl_30,type,
esk2_0: $i ).
thf(decl_31,type,
esk3_0: $i ).
thf(binintersect,axiom,
( binintersect
= ( ^ [X1: $i,X2: $i] :
( dsetconstr @ X1
@ ^ [X3: $i] : ( in @ X3 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',binintersect) ).
thf(binintersectEL,axiom,
( binintersectEL
<=> ! [X1: $i,X2: $i,X3: $i] :
( ( in @ X3 @ ( binintersect @ X1 @ X2 ) )
=> ( in @ X3 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',binintersectEL) ).
thf(binintersectSubset3,conjecture,
( in__Cong
=> ( subsetI1
=> ( binintersectEL
=> ! [X1: $i,X2: $i] :
( ( ( binintersect @ X1 @ X2 )
= X2 )
=> ( subset @ X2 @ X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',binintersectSubset3) ).
thf(subsetI1,axiom,
( subsetI1
<=> ! [X1: $i,X2: $i] :
( ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( in @ X3 @ X2 ) )
=> ( subset @ X1 @ X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsetI1) ).
thf(in__Cong,axiom,
( in__Cong
<=> ! [X1: $i,X2: $i] :
( ( X1 = X2 )
=> ! [X3: $i,X4: $i] :
( ( X3 = X4 )
=> ( ( in @ X3 @ X1 )
<=> ( in @ X4 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',in__Cong) ).
thf(c_0_5,plain,
( binintersect
= ( ^ [Z0: $i,Z1: $i] :
( dsetconstr @ Z0
@ ^ [Z2: $i] : ( in @ Z2 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[binintersect]) ).
thf(c_0_6,axiom,
( binintersectEL
= ( ! [X1: $i,X2: $i,X3: $i] :
( ( in @ X3
@ ( dsetconstr @ X1
@ ^ [Z0: $i] : ( in @ Z0 @ X2 ) ) )
=> ( in @ X3 @ X1 ) ) ) ),
inference(apply_def,[status(thm)],[binintersectEL,c_0_5]) ).
thf(c_0_7,negated_conjecture,
~ ( ! [X17: $i,X18: $i] :
( ( X17 = X18 )
=> ! [X19: $i,X20: $i] :
( ( X19 = X20 )
=> ( ( in @ X19 @ X17 )
<=> ( in @ X20 @ X18 ) ) ) )
=> ( ! [X21: $i,X22: $i] :
( ! [X23: $i] :
( ( in @ X23 @ X21 )
=> ( in @ X23 @ X22 ) )
=> ( subset @ X21 @ X22 ) )
=> ( ! [X24: $i,X25: $i,X26: $i] :
( ( in @ X26
@ ( dsetconstr @ X24
@ ^ [Z0: $i] : ( in @ Z0 @ X25 ) ) )
=> ( in @ X26 @ X24 ) )
=> ! [X1: $i,X2: $i] :
( ( ( dsetconstr @ X1
@ ^ [Z0: $i] : ( in @ Z0 @ X2 ) )
= X2 )
=> ( subset @ X2 @ X1 ) ) ) ) ),
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)],[binintersectSubset3]),subsetI1]),in__Cong]),c_0_6]),c_0_5]) ).
thf(c_0_8,negated_conjecture,
! [X27: $i,X28: $i,X29: $i,X30: $i,X31: $i,X32: $i,X34: $i,X35: $i,X36: $i] :
( ( ~ ( in @ X29 @ X27 )
| ( in @ X30 @ X28 )
| ( X29 != X30 )
| ( X27 != X28 ) )
& ( ~ ( in @ X30 @ X28 )
| ( in @ X29 @ X27 )
| ( X29 != X30 )
| ( X27 != X28 ) )
& ( ( in @ ( esk1_2 @ X31 @ X32 ) @ X31 )
| ( subset @ X31 @ X32 ) )
& ( ~ ( in @ ( esk1_2 @ X31 @ X32 ) @ X32 )
| ( subset @ X31 @ X32 ) )
& ( ~ ( in @ X36
@ ( dsetconstr @ X34
@ ^ [Z0: $i] : ( in @ Z0 @ X35 ) ) )
| ( in @ X36 @ X34 ) )
& ( ( dsetconstr @ esk2_0
@ ^ [Z0: $i] : ( in @ Z0 @ esk3_0 ) )
= esk3_0 )
& ~ ( subset @ esk3_0 @ esk2_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_7])])])])])]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( in @ X1 @ X2 )
| ~ ( in @ X1
@ ( dsetconstr @ X2
@ ^ [Z0: $i] : ( in @ Z0 @ X3 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_10,negated_conjecture,
( ( dsetconstr @ esk2_0
@ ^ [Z0: $i] : ( in @ Z0 @ esk3_0 ) )
= esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_11,negated_conjecture,
! [X1: $i,X2: $i] :
( ( subset @ X1 @ X2 )
| ~ ( in @ ( esk1_2 @ X1 @ X2 ) @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i] :
( ( in @ X1 @ esk2_0 )
| ~ ( in @ X1 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i] :
( ( subset @ X1 @ esk2_0 )
| ~ ( in @ ( esk1_2 @ X1 @ esk2_0 ) @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i,X2: $i] :
( ( in @ ( esk1_2 @ X1 @ X2 ) @ X1 )
| ( subset @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_15,negated_conjecture,
~ ( subset @ esk3_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU594^2 : TPTP v8.2.0. Released v3.7.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n026.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 16:07:22 EDT 2024
% 0.13/0.34 % 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.48 # Version: 3.1.0-ho
% 0.19/0.48 # Preprocessing class: HSSSSLSSSLSNSFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.48 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.19/0.48 # Starting lpo1_def_fix with 300s (1) cores
% 0.19/0.48 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.19/0.48 # ehoh_best_sine_rwall with pid 31475 completed with status 0
% 0.19/0.48 # Result found by ehoh_best_sine_rwall
% 0.19/0.48 # Preprocessing class: HSSSSLSSSLSNSFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.48 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.19/0.48 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.48 # Search class: HGUSF-FFSF22-MSFFMFNN
% 0.19/0.48 # partial match(1): HGUSF-FFSF22-SSFFMFNN
% 0.19/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.48 # new_ho_10 with pid 31478 completed with status 0
% 0.19/0.48 # Result found by new_ho_10
% 0.19/0.48 # Preprocessing class: HSSSSLSSSLSNSFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.48 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.19/0.48 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.48 # Search class: HGUSF-FFSF22-MSFFMFNN
% 0.19/0.48 # partial match(1): HGUSF-FFSF22-SSFFMFNN
% 0.19/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.48 # Preprocessing time : 0.001 s
% 0.19/0.48 # Presaturation interreduction done
% 0.19/0.48
% 0.19/0.48 # Proof found!
% 0.19/0.48 # SZS status Theorem
% 0.19/0.48 # SZS output start CNFRefutation
% See solution above
% 0.19/0.48 # Parsed axioms : 12
% 0.19/0.48 # Removed by relevancy pruning/SinE : 7
% 0.19/0.48 # Initial clauses : 7
% 0.19/0.48 # Removed in clause preprocessing : 2
% 0.19/0.48 # Initial clauses in saturation : 5
% 0.19/0.48 # Processed clauses : 13
% 0.19/0.48 # ...of these trivial : 0
% 0.19/0.48 # ...subsumed : 0
% 0.19/0.48 # ...remaining for further processing : 13
% 0.19/0.48 # Other redundant clauses eliminated : 0
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 0
% 0.19/0.48 # Backward-rewritten : 0
% 0.19/0.48 # Generated clauses : 5
% 0.19/0.48 # ...of the previous two non-redundant : 4
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 0
% 0.19/0.48 # Paramodulations : 5
% 0.19/0.48 # Factorizations : 0
% 0.19/0.48 # NegExts : 0
% 0.19/0.48 # Equation resolutions : 0
% 0.19/0.48 # Disequality decompositions : 0
% 0.19/0.48 # Total rewrite steps : 0
% 0.19/0.48 # ...of those cached : 0
% 0.19/0.48 # Propositional unsat checks : 0
% 0.19/0.48 # Propositional check models : 0
% 0.19/0.48 # Propositional check unsatisfiable : 0
% 0.19/0.48 # Propositional clauses : 0
% 0.19/0.48 # Propositional clauses after purity: 0
% 0.19/0.48 # Propositional unsat core size : 0
% 0.19/0.48 # Propositional preprocessing time : 0.000
% 0.19/0.48 # Propositional encoding time : 0.000
% 0.19/0.48 # Propositional solver time : 0.000
% 0.19/0.48 # Success case prop preproc time : 0.000
% 0.19/0.48 # Success case prop encoding time : 0.000
% 0.19/0.48 # Success case prop solver time : 0.000
% 0.19/0.48 # Current number of processed clauses : 8
% 0.19/0.48 # Positive orientable unit clauses : 2
% 0.19/0.48 # Positive unorientable unit clauses: 0
% 0.19/0.48 # Negative unit clauses : 1
% 0.19/0.48 # Non-unit-clauses : 5
% 0.19/0.48 # Current number of unprocessed clauses: 1
% 0.19/0.48 # ...number of literals in the above : 2
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 5
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 4
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 4
% 0.19/0.48 # Non-unit clause-clause subsumptions : 0
% 0.19/0.48 # Unit Clause-clause subsumption calls : 2
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 2
% 0.19/0.48 # BW rewrite match successes : 0
% 0.19/0.48 # Condensation attempts : 13
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 961
% 0.19/0.48 # Search garbage collected termcells : 334
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.004 s
% 0.19/0.48 # System time : 0.002 s
% 0.19/0.48 # Total time : 0.006 s
% 0.19/0.48 # Maximum resident set size: 1908 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.005 s
% 0.19/0.48 # System time : 0.004 s
% 0.19/0.48 # Total time : 0.009 s
% 0.19/0.48 # Maximum resident set size: 1704 pages
% 0.19/0.48 % E---3.1 exiting
% 0.19/0.48 % E exiting
%------------------------------------------------------------------------------