TSTP Solution File: SEU563^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU563^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:12 EDT 2024
% Result : Theorem 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 20 ( 6 unt; 8 typ; 0 def)
% Number of atoms : 47 ( 3 equ; 0 cnn)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 109 ( 12 ~; 6 |; 4 &; 68 @)
% ( 2 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 28 ( 4 ^ 24 !; 0 ?; 28 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
emptyset: $i ).
thf(decl_24,type,
emptysetimpfalse: $o ).
thf(decl_25,type,
subset: $i > $i > $o ).
thf(decl_26,type,
subsetI2: $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(subset,axiom,
( subset
= ( ^ [X2: $i,X3: $i] :
! [X1: $i] :
( ( in @ X1 @ X2 )
=> ( in @ X1 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset) ).
thf(subsetI2,axiom,
( subsetI2
<=> ! [X2: $i,X3: $i] :
( ! [X1: $i] :
( ( in @ X1 @ X2 )
=> ( in @ X1 @ X3 ) )
=> ( subset @ X2 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsetI2) ).
thf(emptysetsubset,conjecture,
( emptysetimpfalse
=> ( subsetI2
=> ! [X2: $i] : ( subset @ emptyset @ X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptysetsubset) ).
thf(emptysetimpfalse,axiom,
( emptysetimpfalse
<=> ! [X1: $i] :
( ( in @ X1 @ emptyset )
=> ~ $true ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptysetimpfalse) ).
thf(c_0_4,plain,
( subset
= ( ^ [Z0: $i,Z1: $i] :
! [X1: $i] :
( ( in @ X1 @ Z0 )
=> ( in @ X1 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[subset]) ).
thf(c_0_5,axiom,
( subsetI2
= ( ! [X2: $i,X3: $i] :
( ! [X1: $i] :
( ( in @ X1 @ X2 )
=> ( in @ X1 @ X3 ) )
=> ! [X9: $i] :
( ( in @ X9 @ X2 )
=> ( in @ X9 @ X3 ) ) ) ) ),
inference(apply_def,[status(thm)],[subsetI2,c_0_4]) ).
thf(c_0_6,negated_conjecture,
~ ( ! [X10: $i] :
( ( in @ X10 @ emptyset )
=> ~ $true )
=> ( ! [X11: $i,X12: $i] :
( ! [X13: $i] :
( ( in @ X13 @ X11 )
=> ( in @ X13 @ X12 ) )
=> ! [X14: $i] :
( ( in @ X14 @ X11 )
=> ( in @ X14 @ X12 ) ) )
=> ! [X2: $i,X15: $i] :
( ( in @ X15 @ emptyset )
=> ( in @ X15 @ X2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[emptysetsubset]),c_0_4]),emptysetimpfalse]),c_0_5]) ).
thf(c_0_7,negated_conjecture,
! [X16: $i,X17: $i,X18: $i,X20: $i] :
( ( ~ ( in @ X16 @ emptyset )
| ~ $true )
& ( ( in @ ( esk1_2 @ X17 @ X18 ) @ X17 )
| ~ ( in @ X20 @ X17 )
| ( in @ X20 @ X18 ) )
& ( ~ ( in @ ( esk1_2 @ X17 @ X18 ) @ X18 )
| ~ ( in @ X20 @ X17 )
| ( in @ X20 @ X18 ) )
& ( in @ esk3_0 @ emptyset )
& ~ ( in @ esk3_0 @ 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_6])])])])])]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i] :
( ~ ( in @ X1 @ emptyset )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_9,negated_conjecture,
in @ esk3_0 @ emptyset,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i] :
~ ( in @ X1 @ emptyset ),
inference(cn,[status(thm)],[c_0_8]) ).
thf(c_0_11,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_9,c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU563^2 : TPTP v8.2.0. Released v3.7.0.
% 0.04/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n014.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 17:32:37 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running higher-order theorem proving
% 0.19/0.46 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.19/0.48 # Version: 3.1.0-ho
% 0.19/0.48 # Preprocessing class: HSSSSLSSSLSNSFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.48 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.19/0.48 # Starting lpo1_def_fix with 300s (1) cores
% 0.19/0.48 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.19/0.48 # lpo1_def_fix with pid 13446 completed with status 0
% 0.19/0.48 # Result found by lpo1_def_fix
% 0.19/0.48 # Preprocessing class: HSSSSLSSSLSNSFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.48 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.19/0.48 # Starting lpo1_def_fix with 300s (1) cores
% 0.19/0.48 # SinE strategy is gf600_gu_R05_F100_L20000
% 0.19/0.48 # Search class: HGUNF-FFSF22-SSFFMFNN
% 0.19/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting new_ho_10 with 181s (1) cores
% 0.19/0.48 # new_ho_10 with pid 13451 completed with status 0
% 0.19/0.48 # Result found by new_ho_10
% 0.19/0.48 # Preprocessing class: HSSSSLSSSLSNSFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.48 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.19/0.48 # Starting lpo1_def_fix with 300s (1) cores
% 0.19/0.48 # SinE strategy is gf600_gu_R05_F100_L20000
% 0.19/0.48 # Search class: HGUNF-FFSF22-SSFFMFNN
% 0.19/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting new_ho_10 with 181s (1) cores
% 0.19/0.48 # Preprocessing time : 0.001 s
% 0.19/0.48 # Presaturation interreduction done
% 0.19/0.48
% 0.19/0.48 # Proof found!
% 0.19/0.48 # SZS status Theorem
% 0.19/0.48 # SZS output start CNFRefutation
% See solution above
% 0.19/0.48 # Parsed axioms : 9
% 0.19/0.48 # Removed by relevancy pruning/SinE : 5
% 0.19/0.48 # Initial clauses : 5
% 0.19/0.48 # Removed in clause preprocessing : 0
% 0.19/0.48 # Initial clauses in saturation : 5
% 0.19/0.48 # Processed clauses : 3
% 0.19/0.48 # ...of these trivial : 0
% 0.19/0.48 # ...subsumed : 0
% 0.19/0.48 # ...remaining for further processing : 3
% 0.19/0.48 # Other redundant clauses eliminated : 0
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 0
% 0.19/0.48 # Backward-rewritten : 0
% 0.19/0.48 # Generated clauses : 1
% 0.19/0.48 # ...of the previous two non-redundant : 0
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 0
% 0.19/0.48 # Paramodulations : 0
% 0.19/0.48 # Factorizations : 0
% 0.19/0.48 # NegExts : 0
% 0.19/0.48 # Equation resolutions : 0
% 0.19/0.48 # Disequality decompositions : 0
% 0.19/0.48 # Total rewrite steps : 0
% 0.19/0.48 # ...of those cached : 0
% 0.19/0.48 # Propositional unsat checks : 0
% 0.19/0.48 # Propositional check models : 0
% 0.19/0.48 # Propositional check unsatisfiable : 0
% 0.19/0.48 # Propositional clauses : 0
% 0.19/0.48 # Propositional clauses after purity: 0
% 0.19/0.48 # Propositional unsat core size : 0
% 0.19/0.48 # Propositional preprocessing time : 0.000
% 0.19/0.48 # Propositional encoding time : 0.000
% 0.19/0.48 # Propositional solver time : 0.000
% 0.19/0.48 # Success case prop preproc time : 0.000
% 0.19/0.48 # Success case prop encoding time : 0.000
% 0.19/0.48 # Success case prop solver time : 0.000
% 0.19/0.48 # Current number of processed clauses : 2
% 0.19/0.48 # Positive orientable unit clauses : 0
% 0.19/0.48 # Positive unorientable unit clauses: 0
% 0.19/0.48 # Negative unit clauses : 2
% 0.19/0.48 # Non-unit-clauses : 0
% 0.19/0.48 # Current number of unprocessed clauses: 2
% 0.19/0.48 # ...number of literals in the above : 6
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 1
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.48 # Non-unit clause-clause subsumptions : 0
% 0.19/0.48 # Unit Clause-clause subsumption calls : 0
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 0
% 0.19/0.48 # BW rewrite match successes : 0
% 0.19/0.48 # Condensation attempts : 3
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 558
% 0.19/0.48 # Search garbage collected termcells : 219
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.005 s
% 0.19/0.48 # System time : 0.000 s
% 0.19/0.48 # Total time : 0.005 s
% 0.19/0.48 # Maximum resident set size: 1740 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.006 s
% 0.19/0.48 # System time : 0.002 s
% 0.19/0.48 # Total time : 0.008 s
% 0.19/0.48 # Maximum resident set size: 1700 pages
% 0.19/0.48 % E---3.1 exiting
% 0.19/0.48 % E exiting
%------------------------------------------------------------------------------