TSTP Solution File: SEU755^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU755^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:55 EDT 2024
% Result : Theorem 0.18s 0.48s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 15
% Syntax : Number of formulae : 31 ( 10 unt; 11 typ; 0 def)
% Number of atoms : 81 ( 0 equ; 0 cnn)
% Maximal formula atoms : 17 ( 4 avg)
% Number of connectives : 317 ( 32 ~; 18 |; 8 &; 224 @)
% ( 3 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 11 usr; 8 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,
binunion: $i > $i > $i ).
thf(decl_25,type,
setminus: $i > $i > $i ).
thf(decl_26,type,
setminusI: $o ).
thf(decl_27,type,
setminusER: $o ).
thf(decl_28,type,
binunionTEcontra: $o ).
thf(decl_29,type,
esk1_0: $i ).
thf(decl_30,type,
esk2_0: $i ).
thf(decl_31,type,
esk3_0: $i ).
thf(decl_32,type,
esk4_0: $i ).
thf(demorgan2b2,conjecture,
( setminusI
=> ( setminusER
=> ( binunionTEcontra
=> ! [X1: $i,X4: $i] :
( ( in @ X4 @ ( powerset @ X1 ) )
=> ! [X5: $i] :
( ( in @ X5 @ ( powerset @ X1 ) )
=> ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( ( in @ X3 @ ( setminus @ X1 @ X4 ) )
=> ( ( in @ X3 @ ( setminus @ X1 @ X5 ) )
=> ( in @ X3 @ ( setminus @ X1 @ ( binunion @ X4 @ X5 ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',demorgan2b2) ).
thf(binunionTEcontra,axiom,
( binunionTEcontra
<=> ! [X1: $i,X4: $i] :
( ( in @ X4 @ ( powerset @ X1 ) )
=> ! [X5: $i] :
( ( in @ X5 @ ( powerset @ X1 ) )
=> ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( ~ ( in @ X3 @ X4 )
=> ( ~ ( in @ X3 @ X5 )
=> ~ ( in @ X3 @ ( binunion @ X4 @ X5 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binunionTEcontra) ).
thf(setminusI,axiom,
( setminusI
<=> ! [X1: $i,X2: $i,X3: $i] :
( ( in @ X3 @ X1 )
=> ( ~ ( in @ X3 @ X2 )
=> ( in @ X3 @ ( setminus @ X1 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setminusI) ).
thf(setminusER,axiom,
( setminusER
<=> ! [X1: $i,X2: $i,X3: $i] :
( ( in @ X3 @ ( setminus @ X1 @ X2 ) )
=> ~ ( in @ X3 @ X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setminusER) ).
thf(c_0_4,negated_conjecture,
~ ( ! [X20: $i,X21: $i,X22: $i] :
( ( in @ X22 @ X20 )
=> ( ~ ( in @ X22 @ X21 )
=> ( in @ X22 @ ( setminus @ X20 @ X21 ) ) ) )
=> ( ! [X23: $i,X24: $i,X25: $i] :
( ( in @ X25 @ ( setminus @ X23 @ X24 ) )
=> ~ ( in @ X25 @ X24 ) )
=> ( ! [X26: $i,X27: $i] :
( ( in @ X27 @ ( powerset @ X26 ) )
=> ! [X28: $i] :
( ( in @ X28 @ ( powerset @ X26 ) )
=> ! [X29: $i] :
( ( in @ X29 @ X26 )
=> ( ~ ( in @ X29 @ X27 )
=> ( ~ ( in @ X29 @ X28 )
=> ~ ( in @ X29 @ ( binunion @ X27 @ X28 ) ) ) ) ) ) )
=> ! [X1: $i,X4: $i] :
( ( in @ X4 @ ( powerset @ X1 ) )
=> ! [X5: $i] :
( ( in @ X5 @ ( powerset @ X1 ) )
=> ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( ( in @ X3 @ ( setminus @ X1 @ X4 ) )
=> ( ( in @ X3 @ ( setminus @ X1 @ X5 ) )
=> ( in @ X3 @ ( setminus @ X1 @ ( binunion @ X4 @ X5 ) ) ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[demorgan2b2]),binunionTEcontra]),setminusI]),setminusER])]) ).
thf(c_0_5,negated_conjecture,
! [X30: $i,X31: $i,X32: $i,X33: $i,X34: $i,X35: $i,X36: $i,X37: $i,X38: $i,X39: $i] :
( ( ~ ( in @ X32 @ X30 )
| ( in @ X32 @ X31 )
| ( in @ X32 @ ( setminus @ X30 @ X31 ) ) )
& ( ~ ( in @ X35 @ ( setminus @ X33 @ X34 ) )
| ~ ( in @ X35 @ X34 ) )
& ( ~ ( in @ X37 @ ( powerset @ X36 ) )
| ~ ( in @ X38 @ ( powerset @ X36 ) )
| ~ ( in @ X39 @ X36 )
| ( in @ X39 @ X37 )
| ( in @ X39 @ X38 )
| ~ ( in @ X39 @ ( binunion @ X37 @ X38 ) ) )
& ( in @ esk2_0 @ ( powerset @ esk1_0 ) )
& ( in @ esk3_0 @ ( powerset @ esk1_0 ) )
& ( in @ esk4_0 @ esk1_0 )
& ( in @ esk4_0 @ ( setminus @ esk1_0 @ esk2_0 ) )
& ( in @ esk4_0 @ ( setminus @ esk1_0 @ esk3_0 ) )
& ~ ( in @ esk4_0 @ ( setminus @ esk1_0 @ ( binunion @ esk2_0 @ esk3_0 ) ) ) ),
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,
~ ( in @ esk4_0 @ ( setminus @ esk1_0 @ ( binunion @ esk2_0 @ esk3_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_7,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( in @ X1 @ X3 )
| ( in @ X1 @ ( setminus @ X2 @ X3 ) )
| ~ ( in @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
in @ esk4_0 @ esk1_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ~ ( in @ X1 @ ( setminus @ X2 @ X3 ) )
| ~ ( in @ X1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_10,negated_conjecture,
in @ esk4_0 @ ( setminus @ esk1_0 @ esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_11,negated_conjecture,
in @ esk4_0 @ ( setminus @ esk1_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_12,negated_conjecture,
! [X2: $i,X1: $i,X4: $i,X3: $i] :
( ( in @ X4 @ X1 )
| ( in @ X4 @ X3 )
| ~ ( in @ X1 @ ( powerset @ X2 ) )
| ~ ( in @ X3 @ ( powerset @ X2 ) )
| ~ ( in @ X4 @ X2 )
| ~ ( in @ X4 @ ( binunion @ X1 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_13,negated_conjecture,
in @ esk4_0 @ ( binunion @ esk2_0 @ esk3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]) ).
thf(c_0_14,negated_conjecture,
~ ( in @ esk4_0 @ esk3_0 ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_15,negated_conjecture,
~ ( in @ esk4_0 @ esk2_0 ),
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i] :
( ~ ( in @ esk3_0 @ ( powerset @ X1 ) )
| ~ ( in @ esk2_0 @ ( powerset @ X1 ) )
| ~ ( in @ esk4_0 @ X1 ) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15]) ).
thf(c_0_17,negated_conjecture,
in @ esk3_0 @ ( powerset @ esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_18,negated_conjecture,
in @ esk2_0 @ ( powerset @ esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU755^2 : TPTP v8.2.0. Released v3.7.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n027.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Sun May 19 16:05:52 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.18/0.46 Running higher-order theorem proving
% 0.18/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.18/0.48 # Version: 3.1.0-ho
% 0.18/0.48 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.18/0.48 # Starting post_as_ho8 with 300s (1) cores
% 0.18/0.48 # Starting post_as_ho3 with 300s (1) cores
% 0.18/0.48 # Starting post_as_ho2 with 300s (1) cores
% 0.18/0.48 # post_as_ho8 with pid 25844 completed with status 0
% 0.18/0.48 # Result found by post_as_ho8
% 0.18/0.48 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.18/0.48 # Starting post_as_ho8 with 300s (1) cores
% 0.18/0.48 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.18/0.48 # Search class: HGHNF-FFSS21-SFFFMFNN
% 0.18/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.48 # Starting new_ho_10 with 163s (1) cores
% 0.18/0.48 # new_ho_10 with pid 25847 completed with status 0
% 0.18/0.48 # Result found by new_ho_10
% 0.18/0.48 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.18/0.48 # Starting post_as_ho8 with 300s (1) cores
% 0.18/0.48 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.18/0.48 # Search class: HGHNF-FFSS21-SFFFMFNN
% 0.18/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.48 # Starting new_ho_10 with 163s (1) cores
% 0.18/0.48 # Preprocessing time : 0.001 s
% 0.18/0.48 # Presaturation interreduction done
% 0.18/0.48
% 0.18/0.48 # Proof found!
% 0.18/0.48 # SZS status Theorem
% 0.18/0.48 # SZS output start CNFRefutation
% See solution above
% 0.18/0.48 # Parsed axioms : 11
% 0.18/0.48 # Removed by relevancy pruning/SinE : 7
% 0.18/0.48 # Initial clauses : 9
% 0.18/0.48 # Removed in clause preprocessing : 0
% 0.18/0.48 # Initial clauses in saturation : 9
% 0.18/0.48 # Processed clauses : 22
% 0.18/0.48 # ...of these trivial : 0
% 0.18/0.48 # ...subsumed : 0
% 0.18/0.48 # ...remaining for further processing : 22
% 0.18/0.48 # Other redundant clauses eliminated : 0
% 0.18/0.48 # Clauses deleted for lack of memory : 0
% 0.18/0.48 # Backward-subsumed : 0
% 0.18/0.48 # Backward-rewritten : 0
% 0.18/0.48 # Generated clauses : 6
% 0.18/0.48 # ...of the previous two non-redundant : 4
% 0.18/0.48 # ...aggressively subsumed : 0
% 0.18/0.48 # Contextual simplify-reflections : 0
% 0.18/0.48 # Paramodulations : 6
% 0.18/0.48 # Factorizations : 0
% 0.18/0.48 # NegExts : 0
% 0.18/0.48 # Equation resolutions : 0
% 0.18/0.48 # Disequality decompositions : 0
% 0.18/0.48 # Total rewrite steps : 3
% 0.18/0.48 # ...of those cached : 1
% 0.18/0.48 # Propositional unsat checks : 0
% 0.18/0.48 # Propositional check models : 0
% 0.18/0.48 # Propositional check unsatisfiable : 0
% 0.18/0.48 # Propositional clauses : 0
% 0.18/0.48 # Propositional clauses after purity: 0
% 0.18/0.48 # Propositional unsat core size : 0
% 0.18/0.48 # Propositional preprocessing time : 0.000
% 0.18/0.48 # Propositional encoding time : 0.000
% 0.18/0.48 # Propositional solver time : 0.000
% 0.18/0.48 # Success case prop preproc time : 0.000
% 0.18/0.48 # Success case prop encoding time : 0.000
% 0.18/0.48 # Success case prop solver time : 0.000
% 0.18/0.48 # Current number of processed clauses : 13
% 0.18/0.48 # Positive orientable unit clauses : 6
% 0.18/0.48 # Positive unorientable unit clauses: 0
% 0.18/0.48 # Negative unit clauses : 3
% 0.18/0.48 # Non-unit-clauses : 4
% 0.18/0.48 # Current number of unprocessed clauses: 0
% 0.18/0.48 # ...number of literals in the above : 0
% 0.18/0.48 # Current number of archived formulas : 0
% 0.18/0.48 # Current number of archived clauses : 9
% 0.18/0.48 # Clause-clause subsumption calls (NU) : 8
% 0.18/0.48 # Rec. Clause-clause subsumption calls : 2
% 0.18/0.48 # Non-unit clause-clause subsumptions : 0
% 0.18/0.48 # Unit Clause-clause subsumption calls : 6
% 0.18/0.48 # Rewrite failures with RHS unbound : 0
% 0.18/0.48 # BW rewrite match attempts : 0
% 0.18/0.48 # BW rewrite match successes : 0
% 0.18/0.48 # Condensation attempts : 22
% 0.18/0.48 # Condensation successes : 0
% 0.18/0.48 # Termbank termtop insertions : 1340
% 0.18/0.48 # Search garbage collected termcells : 437
% 0.18/0.48
% 0.18/0.48 # -------------------------------------------------
% 0.18/0.48 # User time : 0.003 s
% 0.18/0.48 # System time : 0.003 s
% 0.18/0.48 # Total time : 0.006 s
% 0.18/0.48 # Maximum resident set size: 1904 pages
% 0.18/0.48
% 0.18/0.48 # -------------------------------------------------
% 0.18/0.48 # User time : 0.005 s
% 0.18/0.48 # System time : 0.004 s
% 0.18/0.48 # Total time : 0.010 s
% 0.18/0.48 # Maximum resident set size: 1700 pages
% 0.18/0.48 % E---3.1 exiting
% 0.18/0.48 % E exiting
%------------------------------------------------------------------------------