TSTP Solution File: SEU604^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU604^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:30 EDT 2024
% Result : Theorem 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 18
% Syntax : Number of formulae : 33 ( 4 unt; 12 typ; 0 def)
% Number of atoms : 76 ( 8 equ; 0 cnn)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 239 ( 20 ~; 17 |; 7 &; 164 @)
% ( 5 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 9 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 64 ( 0 ^ 64 !; 0 ?; 64 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
emptyset: $i ).
thf(decl_24,type,
subset: $i > $i > $o ).
thf(decl_25,type,
subsetI2: $o ).
thf(decl_26,type,
subsetE: $o ).
thf(decl_27,type,
subsetemptysetimpeq: $o ).
thf(decl_28,type,
setminus: $i > $i > $i ).
thf(decl_29,type,
setminusEL: $o ).
thf(decl_30,type,
setminusER: $o ).
thf(decl_31,type,
esk1_2: $i > $i > $i ).
thf(decl_32,type,
esk2_0: $i ).
thf(decl_33,type,
esk3_0: $i ).
thf(setminusSubset2,conjecture,
( subsetI2
=> ( subsetE
=> ( subsetemptysetimpeq
=> ( setminusEL
=> ( setminusER
=> ! [X1: $i,X2: $i] :
( ( subset @ X1 @ X2 )
=> ( ( setminus @ X1 @ X2 )
= emptyset ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setminusSubset2) ).
thf(subsetI2,axiom,
( subsetI2
<=> ! [X1: $i,X2: $i] :
( ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( in @ X3 @ X2 ) )
=> ( subset @ X1 @ X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsetI2) ).
thf(subsetE,axiom,
( subsetE
<=> ! [X1: $i,X2: $i,X3: $i] :
( ( subset @ X1 @ X2 )
=> ( ( in @ X3 @ X1 )
=> ( in @ X3 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsetE) ).
thf(subsetemptysetimpeq,axiom,
( subsetemptysetimpeq
<=> ! [X1: $i] :
( ( subset @ X1 @ emptyset )
=> ( X1 = emptyset ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsetemptysetimpeq) ).
thf(setminusEL,axiom,
( setminusEL
<=> ! [X1: $i,X2: $i,X3: $i] :
( ( in @ X3 @ ( setminus @ X1 @ X2 ) )
=> ( in @ X3 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setminusEL) ).
thf(setminusER,axiom,
( setminusER
<=> ! [X1: $i,X2: $i,X3: $i] :
( ( in @ X3 @ ( setminus @ X1 @ X2 ) )
=> ~ ( in @ X3 @ X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setminusER) ).
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] :
( ( subset @ X25 @ emptyset )
=> ( X25 = emptyset ) )
=> ( ! [X26: $i,X27: $i,X28: $i] :
( ( in @ X28 @ ( setminus @ X26 @ X27 ) )
=> ( in @ X28 @ X26 ) )
=> ( ! [X29: $i,X30: $i,X31: $i] :
( ( in @ X31 @ ( setminus @ X29 @ X30 ) )
=> ~ ( in @ X31 @ X30 ) )
=> ! [X1: $i,X2: $i] :
( ( subset @ X1 @ X2 )
=> ( ( setminus @ X1 @ X2 )
= emptyset ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[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)],[setminusSubset2]),subsetI2]),subsetE]),subsetemptysetimpeq]),setminusEL]),setminusER])]) ).
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 @ emptyset )
| ( X38 = emptyset ) )
& ( ~ ( in @ X41 @ ( setminus @ X39 @ X40 ) )
| ( in @ X41 @ X39 ) )
& ( ~ ( in @ X44 @ ( setminus @ X42 @ X43 ) )
| ~ ( in @ X44 @ X43 ) )
& ( subset @ esk2_0 @ esk3_0 )
& ( ( setminus @ esk2_0 @ esk3_0 )
!= emptyset ) ),
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,
! [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_9,negated_conjecture,
subset @ esk2_0 @ esk3_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( in @ X1 @ X2 )
| ~ ( in @ X1 @ ( setminus @ X2 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
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,
! [X1: $i,X2: $i,X3: $i] :
( ~ ( in @ X1 @ ( setminus @ X2 @ X3 ) )
| ~ ( in @ X1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i] :
( ( in @ X1 @ esk3_0 )
| ~ ( in @ X1 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( in @ ( esk1_2 @ ( setminus @ X1 @ X2 ) @ X3 ) @ X1 )
| ( subset @ ( setminus @ X1 @ X2 ) @ X3 ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( subset @ ( setminus @ X1 @ X2 ) @ X3 )
| ~ ( in @ ( esk1_2 @ ( setminus @ X1 @ X2 ) @ X3 ) @ X2 ) ),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i,X2: $i] :
( ( in @ ( esk1_2 @ ( setminus @ esk2_0 @ X1 ) @ X2 ) @ esk3_0 )
| ( subset @ ( setminus @ esk2_0 @ X1 ) @ X2 ) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i] :
( ( X1 = emptyset )
| ~ ( subset @ X1 @ emptyset ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_18,negated_conjecture,
! [X1: $i] : ( subset @ ( setminus @ esk2_0 @ esk3_0 ) @ X1 ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_19,negated_conjecture,
( ( setminus @ esk2_0 @ esk3_0 )
!= emptyset ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : SEU604^2 : TPTP v8.2.0. Released v3.7.0.
% 0.09/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n007.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 15:48:52 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.52 Running higher-order theorem proving
% 0.21/0.52 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.53 # Version: 3.1.0-ho
% 0.21/0.53 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.21/0.53 # Starting post_as_ho8 with 300s (1) cores
% 0.21/0.53 # Starting post_as_ho3 with 300s (1) cores
% 0.21/0.53 # Starting post_as_ho2 with 300s (1) cores
% 0.21/0.53 # lpo6_lambda_fix with pid 7256 completed with status 0
% 0.21/0.53 # Result found by lpo6_lambda_fix
% 0.21/0.53 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.21/0.53 # No SInE strategy applied
% 0.21/0.53 # Search class: HGHSF-FFSF22-SFFFMFNN
% 0.21/0.53 # partial match(1): HGUSF-FFSF22-SFFFMFNN
% 0.21/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.53 # Starting new_ho_10 with 811s (1) cores
% 0.21/0.53 # Starting lpo6_lambda_fix with 151s (1) cores
% 0.21/0.53 # Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.21/0.53 # Starting lpo1_def_fix with 136s (1) cores
% 0.21/0.53 # Starting ehoh_best8_lambda with 136s (1) cores
% 0.21/0.53 # lpo1_def_fix with pid 7264 completed with status 0
% 0.21/0.53 # Result found by lpo1_def_fix
% 0.21/0.53 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.21/0.53 # No SInE strategy applied
% 0.21/0.53 # Search class: HGHSF-FFSF22-SFFFMFNN
% 0.21/0.53 # partial match(1): HGUSF-FFSF22-SFFFMFNN
% 0.21/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.53 # Starting new_ho_10 with 811s (1) cores
% 0.21/0.53 # Starting lpo6_lambda_fix with 151s (1) cores
% 0.21/0.53 # Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.21/0.53 # Starting lpo1_def_fix with 136s (1) cores
% 0.21/0.53 # Preprocessing time : 0.001 s
% 0.21/0.53 # Presaturation interreduction done
% 0.21/0.53
% 0.21/0.53 # Proof found!
% 0.21/0.53 # SZS status Theorem
% 0.21/0.53 # SZS output start CNFRefutation
% See solution above
% 0.21/0.53 # Parsed axioms : 15
% 0.21/0.53 # Removed by relevancy pruning/SinE : 0
% 0.21/0.53 # Initial clauses : 17
% 0.21/0.53 # Removed in clause preprocessing : 9
% 0.21/0.53 # Initial clauses in saturation : 8
% 0.21/0.53 # Processed clauses : 34
% 0.21/0.53 # ...of these trivial : 1
% 0.21/0.53 # ...subsumed : 2
% 0.21/0.53 # ...remaining for further processing : 31
% 0.21/0.53 # Other redundant clauses eliminated : 0
% 0.21/0.53 # Clauses deleted for lack of memory : 0
% 0.21/0.53 # Backward-subsumed : 1
% 0.21/0.53 # Backward-rewritten : 2
% 0.21/0.53 # Generated clauses : 37
% 0.21/0.53 # ...of the previous two non-redundant : 26
% 0.21/0.53 # ...aggressively subsumed : 0
% 0.21/0.53 # Contextual simplify-reflections : 1
% 0.21/0.53 # Paramodulations : 37
% 0.21/0.53 # Factorizations : 0
% 0.21/0.53 # NegExts : 0
% 0.21/0.53 # Equation resolutions : 0
% 0.21/0.53 # Disequality decompositions : 0
% 0.21/0.53 # Total rewrite steps : 12
% 0.21/0.53 # ...of those cached : 6
% 0.21/0.53 # Propositional unsat checks : 0
% 0.21/0.53 # Propositional check models : 0
% 0.21/0.53 # Propositional check unsatisfiable : 0
% 0.21/0.53 # Propositional clauses : 0
% 0.21/0.53 # Propositional clauses after purity: 0
% 0.21/0.53 # Propositional unsat core size : 0
% 0.21/0.53 # Propositional preprocessing time : 0.000
% 0.21/0.53 # Propositional encoding time : 0.000
% 0.21/0.53 # Propositional solver time : 0.000
% 0.21/0.53 # Success case prop preproc time : 0.000
% 0.21/0.53 # Success case prop encoding time : 0.000
% 0.21/0.53 # Success case prop solver time : 0.000
% 0.21/0.53 # Current number of processed clauses : 20
% 0.21/0.53 # Positive orientable unit clauses : 7
% 0.21/0.53 # Positive unorientable unit clauses: 0
% 0.21/0.53 # Negative unit clauses : 2
% 0.21/0.53 # Non-unit-clauses : 11
% 0.21/0.53 # Current number of unprocessed clauses: 7
% 0.21/0.53 # ...number of literals in the above : 13
% 0.21/0.53 # Current number of archived formulas : 0
% 0.21/0.53 # Current number of archived clauses : 11
% 0.21/0.53 # Clause-clause subsumption calls (NU) : 20
% 0.21/0.53 # Rec. Clause-clause subsumption calls : 17
% 0.21/0.53 # Non-unit clause-clause subsumptions : 1
% 0.21/0.53 # Unit Clause-clause subsumption calls : 13
% 0.21/0.53 # Rewrite failures with RHS unbound : 0
% 0.21/0.53 # BW rewrite match attempts : 9
% 0.21/0.53 # BW rewrite match successes : 2
% 0.21/0.53 # Condensation attempts : 0
% 0.21/0.53 # Condensation successes : 0
% 0.21/0.53 # Termbank termtop insertions : 1534
% 0.21/0.53 # Search garbage collected termcells : 399
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.006 s
% 0.21/0.53 # System time : 0.002 s
% 0.21/0.53 # Total time : 0.007 s
% 0.21/0.53 # Maximum resident set size: 1828 pages
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.017 s
% 0.21/0.53 # System time : 0.007 s
% 0.21/0.53 # Total time : 0.024 s
% 0.21/0.53 # Maximum resident set size: 1700 pages
% 0.21/0.53 % E---3.1 exiting
% 0.21/0.54 % E exiting
%------------------------------------------------------------------------------