TSTP Solution File: SEU599^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU599^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of formulae : 23 ( 3 unt; 9 typ; 0 def)
% Number of atoms : 57 ( 12 equ; 0 cnn)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 160 ( 15 ~; 14 |; 6 &; 102 @)
% ( 5 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 42 ( 0 ^ 42 !; 0 ?; 42 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
in__Cong: $o ).
thf(decl_24,type,
subset: $i > $i > $o ).
thf(decl_25,type,
subsetI1: $o ).
thf(decl_26,type,
binintersect: $i > $i > $i ).
thf(decl_27,type,
binintersectER: $o ).
thf(decl_28,type,
esk1_2: $i > $i > $i ).
thf(decl_29,type,
esk2_0: $i ).
thf(decl_30,type,
esk3_0: $i ).
thf(binintersectSubset1,conjecture,
( in__Cong
=> ( subsetI1
=> ( binintersectER
=> ! [X1: $i,X2: $i] :
( ( ( binintersect @ X1 @ X2 )
= X1 )
=> ( subset @ X1 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',binintersectSubset1) ).
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(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(binintersectER,axiom,
( binintersectER
<=> ! [X1: $i,X2: $i,X3: $i] :
( ( in @ X3 @ ( binintersect @ X1 @ X2 ) )
=> ( in @ X3 @ X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',binintersectER) ).
thf(c_0_4,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 @ ( binintersect @ X24 @ X25 ) )
=> ( in @ X26 @ X25 ) )
=> ! [X1: $i,X2: $i] :
( ( ( binintersect @ X1 @ X2 )
= X1 )
=> ( subset @ X1 @ X2 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[binintersectSubset1]),in__Cong]),subsetI1]),binintersectER]) ).
thf(c_0_5,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 @ ( binintersect @ X34 @ X35 ) )
| ( in @ X36 @ X35 ) )
& ( ( binintersect @ esk2_0 @ esk3_0 )
= esk2_0 )
& ~ ( subset @ esk2_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_4])])])])])]) ).
thf(c_0_6,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( in @ X1 @ X3 )
| ~ ( in @ X1 @ ( binintersect @ X2 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_7,negated_conjecture,
( ( binintersect @ esk2_0 @ esk3_0 )
= esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
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_5]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i] :
( ( in @ X1 @ esk3_0 )
| ~ ( in @ X1 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i] :
( ( subset @ X1 @ esk3_0 )
| ~ ( in @ ( esk1_2 @ X1 @ esk3_0 ) @ esk2_0 ) ),
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_5]) ).
thf(c_0_12,negated_conjecture,
~ ( subset @ esk2_0 @ esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_13,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU599^2 : TPTP v8.2.0. Released v3.7.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n014.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 17:47:22 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.48 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: HSSSSLSSSLSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.21/0.50 # Starting post_as_ho8 with 300s (1) cores
% 0.21/0.50 # Starting post_as_ho3 with 300s (1) cores
% 0.21/0.50 # Starting post_as_ho2 with 300s (1) cores
% 0.21/0.50 # lpo6_lambda_fix with pid 16505 completed with status 0
% 0.21/0.50 # Result found by lpo6_lambda_fix
% 0.21/0.50 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: HGUSF-FFSF22-SFFFMFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting new_ho_10 with 811s (1) cores
% 0.21/0.50 # Starting lpo6_lambda_fix with 151s (1) cores
% 0.21/0.50 # Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.21/0.50 # Starting lpo1_def_fix with 136s (1) cores
% 0.21/0.50 # Starting ehoh_best8_lambda with 136s (1) cores
% 0.21/0.50 # new_ho_10 with pid 16510 completed with status 0
% 0.21/0.50 # Result found by new_ho_10
% 0.21/0.50 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: HGUSF-FFSF22-SFFFMFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting new_ho_10 with 811s (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 : 10
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 13
% 0.21/0.50 # Removed in clause preprocessing : 8
% 0.21/0.50 # Initial clauses in saturation : 5
% 0.21/0.50 # Processed clauses : 12
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 0
% 0.21/0.50 # ...remaining for further processing : 12
% 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 : 0
% 0.21/0.50 # Generated clauses : 5
% 0.21/0.50 # ...of the previous two non-redundant : 3
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 0
% 0.21/0.50 # Paramodulations : 5
% 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 : 0
% 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 : 7
% 0.21/0.50 # Positive orientable unit clauses : 1
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 1
% 0.21/0.50 # Non-unit-clauses : 5
% 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 : 5
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 3
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 3
% 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 : 0
% 0.21/0.50 # BW rewrite match successes : 0
% 0.21/0.50 # Condensation attempts : 12
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 918
% 0.21/0.50 # Search garbage collected termcells : 325
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.002 s
% 0.21/0.50 # System time : 0.003 s
% 0.21/0.50 # Total time : 0.005 s
% 0.21/0.50 # Maximum resident set size: 1796 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.008 s
% 0.21/0.50 # System time : 0.009 s
% 0.21/0.50 # Total time : 0.017 s
% 0.21/0.50 # Maximum resident set size: 1700 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.50 % E exiting
%------------------------------------------------------------------------------