TSTP Solution File: SEU524^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU524^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:27:57 EDT 2024
% Result : Theorem 0.17s 0.48s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of formulae : 21 ( 3 unt; 8 typ; 0 def)
% Number of atoms : 43 ( 0 equ; 0 cnn)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 149 ( 11 ~; 10 |; 4 &; 108 @)
% ( 2 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 30 ( 0 ^ 30 !; 0 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
powerset: $i > $i ).
thf(decl_24,type,
setunion: $i > $i ).
thf(decl_25,type,
powersetI: $o ).
thf(decl_26,type,
setunionI: $o ).
thf(decl_27,type,
esk1_2: $i > $i > $i ).
thf(decl_28,type,
esk2_0: $i ).
thf(decl_29,type,
esk3_0: $i ).
thf(subPowSU,conjecture,
( powersetI
=> ( setunionI
=> ! [X1: $i,X3: $i] :
( ( in @ X3 @ X1 )
=> ( in @ X3 @ ( powerset @ ( setunion @ X1 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subPowSU) ).
thf(powersetI,axiom,
( powersetI
<=> ! [X1: $i,X2: $i] :
( ! [X3: $i] :
( ( in @ X3 @ X2 )
=> ( in @ X3 @ X1 ) )
=> ( in @ X2 @ ( powerset @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',powersetI) ).
thf(setunionI,axiom,
( setunionI
<=> ! [X1: $i,X3: $i,X2: $i] :
( ( in @ X3 @ X2 )
=> ( ( in @ X2 @ X1 )
=> ( in @ X3 @ ( setunion @ X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setunionI) ).
thf(c_0_3,negated_conjecture,
~ ( ! [X12: $i,X13: $i] :
( ! [X14: $i] :
( ( in @ X14 @ X13 )
=> ( in @ X14 @ X12 ) )
=> ( in @ X13 @ ( powerset @ X12 ) ) )
=> ( ! [X15: $i,X16: $i,X17: $i] :
( ( in @ X16 @ X17 )
=> ( ( in @ X17 @ X15 )
=> ( in @ X16 @ ( setunion @ X15 ) ) ) )
=> ! [X1: $i,X3: $i] :
( ( in @ X3 @ X1 )
=> ( in @ X3 @ ( powerset @ ( setunion @ X1 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[subPowSU]),powersetI]),setunionI]) ).
thf(c_0_4,negated_conjecture,
! [X18: $i,X19: $i,X21: $i,X22: $i,X23: $i] :
( ( ( in @ ( esk1_2 @ X18 @ X19 ) @ X19 )
| ( in @ X19 @ ( powerset @ X18 ) ) )
& ( ~ ( in @ ( esk1_2 @ X18 @ X19 ) @ X18 )
| ( in @ X19 @ ( powerset @ X18 ) ) )
& ( ~ ( in @ X22 @ X23 )
| ~ ( in @ X23 @ X21 )
| ( in @ X22 @ ( setunion @ X21 ) ) )
& ( in @ esk3_0 @ esk2_0 )
& ~ ( in @ esk3_0 @ ( powerset @ ( setunion @ 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_3])])])])])]) ).
thf(c_0_5,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( in @ X1 @ ( setunion @ X3 ) )
| ~ ( in @ X1 @ X2 )
| ~ ( in @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_6,negated_conjecture,
in @ esk3_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X2: $i,X1: $i] :
( ( in @ X2 @ ( powerset @ X1 ) )
| ~ ( in @ ( esk1_2 @ X1 @ X2 ) @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i] :
( ( in @ X1 @ ( setunion @ esk2_0 ) )
| ~ ( in @ X1 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i] :
( ( in @ X1 @ ( powerset @ ( setunion @ esk2_0 ) ) )
| ~ ( in @ ( esk1_2 @ ( setunion @ esk2_0 ) @ X1 ) @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_10,negated_conjecture,
! [X2: $i,X1: $i] :
( ( in @ ( esk1_2 @ X1 @ X2 ) @ X2 )
| ( in @ X2 @ ( powerset @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_11,negated_conjecture,
~ ( in @ esk3_0 @ ( powerset @ ( setunion @ esk2_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_12,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU524^2 : TPTP v8.2.0. Released v3.7.0.
% 0.04/0.13 % Command : run_E %s %d THM
% 0.10/0.34 % Computer : n016.cluster.edu
% 0.10/0.34 % Model : x86_64 x86_64
% 0.10/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.34 % Memory : 8042.1875MB
% 0.10/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.34 % CPULimit : 300
% 0.10/0.34 % WCLimit : 300
% 0.10/0.34 % DateTime : Sun May 19 16:55:08 EDT 2024
% 0.10/0.34 % CPUTime :
% 0.17/0.47 Running higher-order theorem proving
% 0.17/0.47 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.17/0.48 # Version: 3.1.0-ho
% 0.17/0.48 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.17/0.48 # Starting post_as_ho8 with 300s (1) cores
% 0.17/0.48 # Starting post_as_ho3 with 300s (1) cores
% 0.17/0.48 # Starting post_as_ho2 with 300s (1) cores
% 0.17/0.48 # post_as_ho8 with pid 10158 completed with status 0
% 0.17/0.48 # Result found by post_as_ho8
% 0.17/0.48 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.17/0.48 # Starting post_as_ho8 with 300s (1) cores
% 0.17/0.48 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.17/0.48 # Search class: HGUNF-FFSF21-SFFFMFNN
% 0.17/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.48 # Starting new_ho_10 with 163s (1) cores
% 0.17/0.48 # new_ho_10 with pid 10166 completed with status 0
% 0.17/0.48 # Result found by new_ho_10
% 0.17/0.48 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.17/0.48 # Starting post_as_ho8 with 300s (1) cores
% 0.17/0.48 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.17/0.48 # Search class: HGUNF-FFSF21-SFFFMFNN
% 0.17/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.48 # Starting new_ho_10 with 163s (1) cores
% 0.17/0.48 # Preprocessing time : 0.001 s
% 0.17/0.48 # Presaturation interreduction done
% 0.17/0.48
% 0.17/0.48 # Proof found!
% 0.17/0.48 # SZS status Theorem
% 0.17/0.48 # SZS output start CNFRefutation
% See solution above
% 0.17/0.48 # Parsed axioms : 8
% 0.17/0.48 # Removed by relevancy pruning/SinE : 5
% 0.17/0.48 # Initial clauses : 5
% 0.17/0.48 # Removed in clause preprocessing : 0
% 0.17/0.48 # Initial clauses in saturation : 5
% 0.17/0.48 # Processed clauses : 14
% 0.17/0.48 # ...of these trivial : 0
% 0.17/0.48 # ...subsumed : 0
% 0.17/0.48 # ...remaining for further processing : 14
% 0.17/0.48 # Other redundant clauses eliminated : 0
% 0.17/0.48 # Clauses deleted for lack of memory : 0
% 0.17/0.48 # Backward-subsumed : 0
% 0.17/0.48 # Backward-rewritten : 0
% 0.17/0.48 # Generated clauses : 9
% 0.17/0.48 # ...of the previous two non-redundant : 8
% 0.17/0.48 # ...aggressively subsumed : 0
% 0.17/0.48 # Contextual simplify-reflections : 0
% 0.17/0.48 # Paramodulations : 9
% 0.17/0.48 # Factorizations : 0
% 0.17/0.48 # NegExts : 0
% 0.17/0.48 # Equation resolutions : 0
% 0.17/0.48 # Disequality decompositions : 0
% 0.17/0.48 # Total rewrite steps : 0
% 0.17/0.48 # ...of those cached : 0
% 0.17/0.48 # Propositional unsat checks : 0
% 0.17/0.48 # Propositional check models : 0
% 0.17/0.48 # Propositional check unsatisfiable : 0
% 0.17/0.48 # Propositional clauses : 0
% 0.17/0.48 # Propositional clauses after purity: 0
% 0.17/0.48 # Propositional unsat core size : 0
% 0.17/0.48 # Propositional preprocessing time : 0.000
% 0.17/0.48 # Propositional encoding time : 0.000
% 0.17/0.48 # Propositional solver time : 0.000
% 0.17/0.48 # Success case prop preproc time : 0.000
% 0.17/0.48 # Success case prop encoding time : 0.000
% 0.17/0.48 # Success case prop solver time : 0.000
% 0.17/0.48 # Current number of processed clauses : 9
% 0.17/0.48 # Positive orientable unit clauses : 2
% 0.17/0.48 # Positive unorientable unit clauses: 0
% 0.17/0.48 # Negative unit clauses : 1
% 0.17/0.48 # Non-unit-clauses : 6
% 0.17/0.48 # Current number of unprocessed clauses: 4
% 0.17/0.48 # ...number of literals in the above : 11
% 0.17/0.48 # Current number of archived formulas : 0
% 0.17/0.48 # Current number of archived clauses : 5
% 0.17/0.48 # Clause-clause subsumption calls (NU) : 8
% 0.17/0.48 # Rec. Clause-clause subsumption calls : 8
% 0.17/0.48 # Non-unit clause-clause subsumptions : 0
% 0.17/0.48 # Unit Clause-clause subsumption calls : 2
% 0.17/0.48 # Rewrite failures with RHS unbound : 0
% 0.17/0.48 # BW rewrite match attempts : 3
% 0.17/0.48 # BW rewrite match successes : 0
% 0.17/0.48 # Condensation attempts : 14
% 0.17/0.48 # Condensation successes : 0
% 0.17/0.48 # Termbank termtop insertions : 743
% 0.17/0.48 # Search garbage collected termcells : 218
% 0.17/0.48
% 0.17/0.48 # -------------------------------------------------
% 0.17/0.48 # User time : 0.003 s
% 0.17/0.48 # System time : 0.001 s
% 0.17/0.48 # Total time : 0.004 s
% 0.17/0.48 # Maximum resident set size: 1784 pages
% 0.17/0.48
% 0.17/0.48 # -------------------------------------------------
% 0.17/0.48 # User time : 0.003 s
% 0.17/0.48 # System time : 0.004 s
% 0.17/0.48 # Total time : 0.007 s
% 0.17/0.48 # Maximum resident set size: 1700 pages
% 0.17/0.48 % E---3.1 exiting
% 0.17/0.49 % E exiting
%------------------------------------------------------------------------------