TSTP Solution File: SEU713^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU713^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:29:24 EDT 2024
% Result : Theorem 0.19s 0.46s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of formulae : 27 ( 4 unt; 10 typ; 0 def)
% Number of atoms : 59 ( 0 equ; 0 cnn)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 220 ( 12 ~; 13 |; 6 &; 166 @)
% ( 3 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 9 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 49 ( 0 ^ 49 !; 0 ?; 49 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
powerset: $i > $i ).
thf(decl_24,type,
powersetI: $o ).
thf(decl_25,type,
powersetE: $o ).
thf(decl_26,type,
setminus: $i > $i > $i ).
thf(decl_27,type,
setminusEL: $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(decl_31,type,
esk4_0: $i ).
thf(setminusT_lem,conjecture,
( powersetI
=> ( powersetE
=> ( setminusEL
=> ! [X1: $i,X4: $i] :
( ( in @ X4 @ ( powerset @ X1 ) )
=> ! [X5: $i] :
( ( in @ X5 @ ( powerset @ X1 ) )
=> ( in @ ( setminus @ X4 @ X5 ) @ ( powerset @ X1 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setminusT_lem) ).
thf(setminusEL,axiom,
( setminusEL
<=> ! [X1: $i,X2: $i,X3: $i] :
( ( in @ X3 @ ( setminus @ X1 @ X2 ) )
=> ( in @ X3 @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setminusEL) ).
thf(powersetI,axiom,
( powersetI
<=> ! [X1: $i,X2: $i] :
( ! [X3: $i] :
( ( in @ X3 @ X2 )
=> ( in @ X3 @ X1 ) )
=> ( in @ X2 @ ( powerset @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',powersetI) ).
thf(powersetE,axiom,
( powersetE
<=> ! [X1: $i,X2: $i,X3: $i] :
( ( in @ X2 @ ( powerset @ X1 ) )
=> ( ( in @ X3 @ X2 )
=> ( in @ X3 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',powersetE) ).
thf(c_0_4,negated_conjecture,
~ ( ! [X18: $i,X19: $i] :
( ! [X20: $i] :
( ( in @ X20 @ X19 )
=> ( in @ X20 @ X18 ) )
=> ( in @ X19 @ ( powerset @ X18 ) ) )
=> ( ! [X21: $i,X22: $i,X23: $i] :
( ( in @ X22 @ ( powerset @ X21 ) )
=> ( ( in @ X23 @ X22 )
=> ( in @ X23 @ X21 ) ) )
=> ( ! [X24: $i,X25: $i,X26: $i] :
( ( in @ X26 @ ( setminus @ X24 @ X25 ) )
=> ( in @ X26 @ X24 ) )
=> ! [X1: $i,X4: $i] :
( ( in @ X4 @ ( powerset @ X1 ) )
=> ! [X5: $i] :
( ( in @ X5 @ ( powerset @ X1 ) )
=> ( in @ ( setminus @ X4 @ X5 ) @ ( powerset @ X1 ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[setminusT_lem]),setminusEL]),powersetI]),powersetE]) ).
thf(c_0_5,negated_conjecture,
! [X27: $i,X28: $i,X30: $i,X31: $i,X32: $i,X33: $i,X34: $i,X35: $i] :
( ( ( in @ ( esk1_2 @ X27 @ X28 ) @ X28 )
| ( in @ X28 @ ( powerset @ X27 ) ) )
& ( ~ ( in @ ( esk1_2 @ X27 @ X28 ) @ X27 )
| ( in @ X28 @ ( powerset @ X27 ) ) )
& ( ~ ( in @ X31 @ ( powerset @ X30 ) )
| ~ ( in @ X32 @ X31 )
| ( in @ X32 @ X30 ) )
& ( ~ ( in @ X35 @ ( setminus @ X33 @ X34 ) )
| ( in @ X35 @ X33 ) )
& ( in @ esk3_0 @ ( powerset @ esk2_0 ) )
& ( in @ esk4_0 @ ( powerset @ esk2_0 ) )
& ~ ( in @ ( setminus @ esk3_0 @ esk4_0 ) @ ( powerset @ 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_4])])])])])]) ).
thf(c_0_6,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( in @ X3 @ X2 )
| ~ ( in @ X1 @ ( powerset @ X2 ) )
| ~ ( in @ X3 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_7,negated_conjecture,
in @ esk3_0 @ ( powerset @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( in @ X1 @ X2 )
| ~ ( in @ X1 @ ( setminus @ X2 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
! [X2: $i,X1: $i] :
( ( in @ ( esk1_2 @ X1 @ X2 ) @ X2 )
| ( in @ X2 @ ( powerset @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i] :
( ( in @ X1 @ esk2_0 )
| ~ ( in @ X1 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_11,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( in @ ( esk1_2 @ X1 @ ( setminus @ X2 @ X3 ) ) @ X2 )
| ( in @ ( setminus @ X2 @ X3 ) @ ( powerset @ X1 ) ) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_12,negated_conjecture,
! [X2: $i,X1: $i] :
( ( in @ X2 @ ( powerset @ X1 ) )
| ~ ( in @ ( esk1_2 @ X1 @ X2 ) @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_13,negated_conjecture,
! [X2: $i,X1: $i] :
( ( in @ ( esk1_2 @ X1 @ ( setminus @ esk3_0 @ X2 ) ) @ esk2_0 )
| ( in @ ( setminus @ esk3_0 @ X2 ) @ ( powerset @ X1 ) ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_14,negated_conjecture,
~ ( in @ ( setminus @ esk3_0 @ esk4_0 ) @ ( powerset @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i] : ( in @ ( setminus @ esk3_0 @ X1 ) @ ( powerset @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : SEU713^2 : TPTP v8.2.0. Released v3.7.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n008.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 17:08:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.19/0.45 Running higher-order theorem proving
% 0.19/0.45 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.19/0.46 # Version: 3.1.0-ho
% 0.19/0.46 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.19/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.46 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.19/0.46 # Starting post_as_ho8 with 300s (1) cores
% 0.19/0.46 # Starting post_as_ho3 with 300s (1) cores
% 0.19/0.46 # Starting post_as_ho2 with 300s (1) cores
% 0.19/0.46 # post_as_ho8 with pid 24942 completed with status 0
% 0.19/0.46 # Result found by post_as_ho8
% 0.19/0.46 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.19/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.46 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.19/0.46 # Starting post_as_ho8 with 300s (1) cores
% 0.19/0.46 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.19/0.46 # Search class: HGUNF-FFSF21-SFFFMFNN
% 0.19/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.46 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.46 # new_ho_10 with pid 24945 completed with status 0
% 0.19/0.46 # Result found by new_ho_10
% 0.19/0.46 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.19/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.46 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.19/0.46 # Starting post_as_ho8 with 300s (1) cores
% 0.19/0.46 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.19/0.46 # Search class: HGUNF-FFSF21-SFFFMFNN
% 0.19/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.46 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.46 # Preprocessing time : 0.001 s
% 0.19/0.46 # Presaturation interreduction done
% 0.19/0.46
% 0.19/0.46 # Proof found!
% 0.19/0.46 # SZS status Theorem
% 0.19/0.46 # SZS output start CNFRefutation
% See solution above
% 0.19/0.46 # Parsed axioms : 10
% 0.19/0.46 # Removed by relevancy pruning/SinE : 6
% 0.19/0.46 # Initial clauses : 7
% 0.19/0.46 # Removed in clause preprocessing : 0
% 0.19/0.46 # Initial clauses in saturation : 7
% 0.19/0.46 # Processed clauses : 31
% 0.19/0.46 # ...of these trivial : 0
% 0.19/0.46 # ...subsumed : 1
% 0.19/0.46 # ...remaining for further processing : 30
% 0.19/0.46 # Other redundant clauses eliminated : 0
% 0.19/0.46 # Clauses deleted for lack of memory : 0
% 0.19/0.46 # Backward-subsumed : 0
% 0.19/0.46 # Backward-rewritten : 1
% 0.19/0.46 # Generated clauses : 45
% 0.19/0.46 # ...of the previous two non-redundant : 41
% 0.19/0.46 # ...aggressively subsumed : 0
% 0.19/0.46 # Contextual simplify-reflections : 0
% 0.19/0.46 # Paramodulations : 45
% 0.19/0.46 # Factorizations : 0
% 0.19/0.46 # NegExts : 0
% 0.19/0.46 # Equation resolutions : 0
% 0.19/0.46 # Disequality decompositions : 0
% 0.19/0.46 # Total rewrite steps : 3
% 0.19/0.46 # ...of those cached : 0
% 0.19/0.46 # Propositional unsat checks : 0
% 0.19/0.46 # Propositional check models : 0
% 0.19/0.46 # Propositional check unsatisfiable : 0
% 0.19/0.46 # Propositional clauses : 0
% 0.19/0.46 # Propositional clauses after purity: 0
% 0.19/0.46 # Propositional unsat core size : 0
% 0.19/0.46 # Propositional preprocessing time : 0.000
% 0.19/0.46 # Propositional encoding time : 0.000
% 0.19/0.46 # Propositional solver time : 0.000
% 0.19/0.46 # Success case prop preproc time : 0.000
% 0.19/0.46 # Success case prop encoding time : 0.000
% 0.19/0.46 # Success case prop solver time : 0.000
% 0.19/0.46 # Current number of processed clauses : 22
% 0.19/0.46 # Positive orientable unit clauses : 6
% 0.19/0.46 # Positive unorientable unit clauses: 0
% 0.19/0.46 # Negative unit clauses : 0
% 0.19/0.46 # Non-unit-clauses : 16
% 0.19/0.46 # Current number of unprocessed clauses: 24
% 0.19/0.46 # ...number of literals in the above : 70
% 0.19/0.46 # Current number of archived formulas : 0
% 0.19/0.46 # Current number of archived clauses : 8
% 0.19/0.46 # Clause-clause subsumption calls (NU) : 97
% 0.19/0.46 # Rec. Clause-clause subsumption calls : 73
% 0.19/0.46 # Non-unit clause-clause subsumptions : 1
% 0.19/0.46 # Unit Clause-clause subsumption calls : 12
% 0.19/0.46 # Rewrite failures with RHS unbound : 0
% 0.19/0.46 # BW rewrite match attempts : 8
% 0.19/0.46 # BW rewrite match successes : 1
% 0.19/0.46 # Condensation attempts : 31
% 0.19/0.46 # Condensation successes : 0
% 0.19/0.46 # Termbank termtop insertions : 1772
% 0.19/0.46 # Search garbage collected termcells : 304
% 0.19/0.46
% 0.19/0.46 # -------------------------------------------------
% 0.19/0.46 # User time : 0.003 s
% 0.19/0.46 # System time : 0.003 s
% 0.19/0.46 # Total time : 0.005 s
% 0.19/0.46 # Maximum resident set size: 1752 pages
% 0.19/0.46
% 0.19/0.46 # -------------------------------------------------
% 0.19/0.46 # User time : 0.003 s
% 0.19/0.46 # System time : 0.005 s
% 0.19/0.46 # Total time : 0.008 s
% 0.19/0.46 # Maximum resident set size: 1704 pages
% 0.19/0.46 % E---3.1 exiting
% 0.19/0.46 % E exiting
%------------------------------------------------------------------------------