TSTP Solution File: SEU814^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU814^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:30:30 EDT 2024
% Result : Theorem 0.17s 0.46s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of formulae : 25 ( 7 unt; 9 typ; 0 def)
% Number of atoms : 68 ( 3 equ; 0 cnn)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 175 ( 15 ~; 13 |; 6 &; 114 @)
% ( 2 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 38 ( 2 ^ 36 !; 0 ?; 38 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
subset: $i > $i > $o ).
thf(decl_24,type,
subsetE: $o ).
thf(decl_25,type,
transitiveset: $i > $o ).
thf(decl_26,type,
transitivesetOp1: $o ).
thf(decl_27,type,
esk1_1: $i > $i ).
thf(decl_28,type,
esk2_0: $i ).
thf(decl_29,type,
esk3_0: $i ).
thf(decl_30,type,
esk4_0: $i ).
thf(transitiveset,axiom,
( transitiveset
= ( ^ [X1: $i] :
! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( subset @ X4 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitiveset) ).
thf(transitivesetOp1,axiom,
( transitivesetOp1
<=> ! [X4: $i] :
( ( transitiveset @ X4 )
=> ! [X1: $i] :
( ( in @ X1 @ X4 )
=> ( subset @ X1 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivesetOp1) ).
thf(transitivesetOp2,conjecture,
( subsetE
=> ( transitivesetOp1
=> ! [X4: $i] :
( ( transitiveset @ X4 )
=> ! [X1: $i,X3: $i] :
( ( in @ X1 @ X4 )
=> ( ( in @ X3 @ X1 )
=> ( in @ X3 @ X4 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivesetOp2) ).
thf(subsetE,axiom,
( subsetE
<=> ! [X1: $i,X2: $i,X3: $i] :
( ( subset @ X1 @ X2 )
=> ( ( in @ X3 @ X1 )
=> ( in @ X3 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsetE) ).
thf(c_0_4,plain,
( transitiveset
= ( ^ [Z0: $i] :
! [X4: $i] :
( ( in @ X4 @ Z0 )
=> ( subset @ X4 @ Z0 ) ) ) ),
inference(fof_simplification,[status(thm)],[transitiveset]) ).
thf(c_0_5,axiom,
( transitivesetOp1
= ( ! [X4: $i] :
( ! [X13: $i] :
( ( in @ X13 @ X4 )
=> ( subset @ X13 @ X4 ) )
=> ! [X1: $i] :
( ( in @ X1 @ X4 )
=> ( subset @ X1 @ X4 ) ) ) ) ),
inference(apply_def,[status(thm)],[transitivesetOp1,c_0_4]) ).
thf(c_0_6,negated_conjecture,
~ ( ! [X14: $i,X15: $i,X16: $i] :
( ( subset @ X14 @ X15 )
=> ( ( in @ X16 @ X14 )
=> ( in @ X16 @ X15 ) ) )
=> ( ! [X17: $i] :
( ! [X18: $i] :
( ( in @ X18 @ X17 )
=> ( subset @ X18 @ X17 ) )
=> ! [X19: $i] :
( ( in @ X19 @ X17 )
=> ( subset @ X19 @ X17 ) ) )
=> ! [X4: $i] :
( ! [X20: $i] :
( ( in @ X20 @ X4 )
=> ( subset @ X20 @ X4 ) )
=> ! [X1: $i,X3: $i] :
( ( in @ X1 @ X4 )
=> ( ( in @ X3 @ X1 )
=> ( in @ X3 @ X4 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[transitivesetOp2]),subsetE]),c_0_5]),c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X21: $i,X22: $i,X23: $i,X24: $i,X26: $i,X28: $i] :
( ( ~ ( subset @ X21 @ X22 )
| ~ ( in @ X23 @ X21 )
| ( in @ X23 @ X22 ) )
& ( ( in @ ( esk1_1 @ X24 ) @ X24 )
| ~ ( in @ X26 @ X24 )
| ( subset @ X26 @ X24 ) )
& ( ~ ( subset @ ( esk1_1 @ X24 ) @ X24 )
| ~ ( in @ X26 @ X24 )
| ( subset @ X26 @ X24 ) )
& ( ~ ( in @ X28 @ esk2_0 )
| ( subset @ X28 @ esk2_0 ) )
& ( in @ esk3_0 @ esk2_0 )
& ( in @ esk4_0 @ esk3_0 )
& ~ ( in @ esk4_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,
! [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,
! [X1: $i] :
( ( subset @ X1 @ esk2_0 )
| ~ ( in @ X1 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i,X2: $i] :
( ( in @ X1 @ esk2_0 )
| ~ ( in @ X2 @ esk2_0 )
| ~ ( in @ X1 @ X2 ) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_11,negated_conjecture,
in @ esk3_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i] :
( ( in @ X1 @ esk2_0 )
| ~ ( in @ X1 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_13,negated_conjecture,
in @ esk4_0 @ esk3_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_14,negated_conjecture,
~ ( in @ esk4_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_15,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU814^2 : TPTP v8.2.0. Released v3.7.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n027.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sun May 19 16:15:38 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running higher-order theorem proving
% 0.17/0.44 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.17/0.46 # Version: 3.1.0-ho
% 0.17/0.46 # Preprocessing class: HSSSSLSSSLSNSFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting new_ho_10 with 1500s (5) cores
% 0.17/0.46 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.17/0.46 # Starting lpo1_def_fix with 300s (1) cores
% 0.17/0.46 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.17/0.46 # ehoh_best_sine_rwall with pid 13118 completed with status 0
% 0.17/0.46 # Result found by ehoh_best_sine_rwall
% 0.17/0.46 # Preprocessing class: HSSSSLSSSLSNSFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting new_ho_10 with 1500s (5) cores
% 0.17/0.46 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.17/0.46 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.46 # Search class: HGUNF-FFSF11-SSFFMFNN
% 0.17/0.46 # partial match(1): HHUNF-FFSF11-SSFFMFNN
% 0.17/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting new_ho_10 with 181s (1) cores
% 0.17/0.46 # new_ho_10 with pid 13121 completed with status 0
% 0.17/0.46 # Result found by new_ho_10
% 0.17/0.46 # Preprocessing class: HSSSSLSSSLSNSFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting new_ho_10 with 1500s (5) cores
% 0.17/0.46 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.17/0.46 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.46 # Search class: HGUNF-FFSF11-SSFFMFNN
% 0.17/0.46 # partial match(1): HHUNF-FFSF11-SSFFMFNN
% 0.17/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting new_ho_10 with 181s (1) cores
% 0.17/0.46 # Preprocessing time : 0.001 s
% 0.17/0.46 # Presaturation interreduction done
% 0.17/0.46
% 0.17/0.46 # Proof found!
% 0.17/0.46 # SZS status Theorem
% 0.17/0.46 # SZS output start CNFRefutation
% See solution above
% 0.17/0.46 # Parsed axioms : 9
% 0.17/0.46 # Removed by relevancy pruning/SinE : 5
% 0.17/0.46 # Initial clauses : 7
% 0.17/0.46 # Removed in clause preprocessing : 0
% 0.17/0.46 # Initial clauses in saturation : 7
% 0.17/0.46 # Processed clauses : 14
% 0.17/0.46 # ...of these trivial : 0
% 0.17/0.46 # ...subsumed : 0
% 0.17/0.46 # ...remaining for further processing : 14
% 0.17/0.46 # Other redundant clauses eliminated : 0
% 0.17/0.46 # Clauses deleted for lack of memory : 0
% 0.17/0.46 # Backward-subsumed : 0
% 0.17/0.46 # Backward-rewritten : 0
% 0.17/0.46 # Generated clauses : 3
% 0.17/0.46 # ...of the previous two non-redundant : 2
% 0.17/0.46 # ...aggressively subsumed : 0
% 0.17/0.46 # Contextual simplify-reflections : 0
% 0.17/0.46 # Paramodulations : 3
% 0.17/0.46 # Factorizations : 0
% 0.17/0.46 # NegExts : 0
% 0.17/0.46 # Equation resolutions : 0
% 0.17/0.46 # Disequality decompositions : 0
% 0.17/0.46 # Total rewrite steps : 0
% 0.17/0.46 # ...of those cached : 0
% 0.17/0.46 # Propositional unsat checks : 0
% 0.17/0.46 # Propositional check models : 0
% 0.17/0.46 # Propositional check unsatisfiable : 0
% 0.17/0.46 # Propositional clauses : 0
% 0.17/0.46 # Propositional clauses after purity: 0
% 0.17/0.46 # Propositional unsat core size : 0
% 0.17/0.46 # Propositional preprocessing time : 0.000
% 0.17/0.46 # Propositional encoding time : 0.000
% 0.17/0.46 # Propositional solver time : 0.000
% 0.17/0.46 # Success case prop preproc time : 0.000
% 0.17/0.46 # Success case prop encoding time : 0.000
% 0.17/0.46 # Success case prop solver time : 0.000
% 0.17/0.46 # Current number of processed clauses : 7
% 0.17/0.46 # Positive orientable unit clauses : 2
% 0.17/0.46 # Positive unorientable unit clauses: 0
% 0.17/0.46 # Negative unit clauses : 1
% 0.17/0.46 # Non-unit-clauses : 4
% 0.17/0.46 # Current number of unprocessed clauses: 2
% 0.17/0.46 # ...number of literals in the above : 6
% 0.17/0.46 # Current number of archived formulas : 0
% 0.17/0.46 # Current number of archived clauses : 7
% 0.17/0.46 # Clause-clause subsumption calls (NU) : 3
% 0.17/0.46 # Rec. Clause-clause subsumption calls : 3
% 0.17/0.46 # Non-unit clause-clause subsumptions : 0
% 0.17/0.46 # Unit Clause-clause subsumption calls : 0
% 0.17/0.46 # Rewrite failures with RHS unbound : 0
% 0.17/0.46 # BW rewrite match attempts : 0
% 0.17/0.46 # BW rewrite match successes : 0
% 0.17/0.46 # Condensation attempts : 14
% 0.17/0.46 # Condensation successes : 0
% 0.17/0.46 # Termbank termtop insertions : 863
% 0.17/0.46 # Search garbage collected termcells : 310
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.004 s
% 0.17/0.46 # System time : 0.000 s
% 0.17/0.46 # Total time : 0.004 s
% 0.17/0.46 # Maximum resident set size: 1892 pages
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.005 s
% 0.17/0.46 # System time : 0.002 s
% 0.17/0.46 # Total time : 0.007 s
% 0.17/0.46 # Maximum resident set size: 1704 pages
% 0.17/0.46 % E---3.1 exiting
% 0.17/0.46 % E exiting
%------------------------------------------------------------------------------