TSTP Solution File: SEU619^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU619^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:37 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of formulae : 21 ( 5 unt; 9 typ; 0 def)
% Number of atoms : 35 ( 8 equ; 0 cnn)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 346 ( 9 ~; 5 |; 8 &; 318 @)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 10 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 : 33 ( 2 ^ 25 !; 6 ?; 33 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
emptyset: $i ).
thf(decl_24,type,
setadjoin: $i > $i > $i ).
thf(decl_25,type,
setunion: $i > $i ).
thf(decl_26,type,
iskpair: $i > $o ).
thf(decl_27,type,
setukpairIL: $o ).
thf(decl_28,type,
setukpairIR: $o ).
thf(decl_29,type,
esk1_0: $i ).
thf(decl_30,type,
esk2_0: $i ).
thf(iskpair,axiom,
( iskpair
= ( ^ [X1: $i] :
? [X2: $i] :
( ( in @ X2 @ ( setunion @ X1 ) )
& ? [X3: $i] :
( ( in @ X3 @ ( setunion @ X1 ) )
& ( X1
= ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',iskpair) ).
thf(kpairiskpair,conjecture,
( setukpairIL
=> ( setukpairIR
=> ! [X2: $i,X3: $i] : ( iskpair @ ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kpairiskpair) ).
thf(setukpairIR,axiom,
( setukpairIR
<=> ! [X2: $i,X3: $i] : ( in @ X3 @ ( setunion @ ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setukpairIR) ).
thf(setukpairIL,axiom,
( setukpairIL
<=> ! [X2: $i,X3: $i] : ( in @ X2 @ ( setunion @ ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setukpairIL) ).
thf(c_0_4,plain,
( iskpair
= ( ^ [Z0: $i] :
? [X2: $i] :
( ( in @ X2 @ ( setunion @ Z0 ) )
& ? [X3: $i] :
( ( in @ X3 @ ( setunion @ Z0 ) )
& ( Z0
= ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[iskpair]) ).
thf(c_0_5,negated_conjecture,
~ ( ! [X10: $i,X11: $i] : ( in @ X10 @ ( setunion @ ( setadjoin @ ( setadjoin @ X10 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X10 @ ( setadjoin @ X11 @ emptyset ) ) @ emptyset ) ) ) )
=> ( ! [X12: $i,X13: $i] : ( in @ X13 @ ( setunion @ ( setadjoin @ ( setadjoin @ X12 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X12 @ ( setadjoin @ X13 @ emptyset ) ) @ emptyset ) ) ) )
=> ! [X2: $i,X3: $i] :
? [X14: $i] :
( ( in @ X14 @ ( setunion @ ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) ) ) )
& ? [X15: $i] :
( ( in @ X15 @ ( setunion @ ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) ) ) )
& ( ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ X14 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X14 @ ( setadjoin @ X15 @ emptyset ) ) @ emptyset ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[kpairiskpair]),c_0_4]),setukpairIR]),setukpairIL]) ).
thf(c_0_6,negated_conjecture,
! [X16: $i,X17: $i,X18: $i,X19: $i,X22: $i,X23: $i] :
( ( in @ X16 @ ( setunion @ ( setadjoin @ ( setadjoin @ X16 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X16 @ ( setadjoin @ X17 @ emptyset ) ) @ emptyset ) ) ) )
& ( in @ X19 @ ( setunion @ ( setadjoin @ ( setadjoin @ X18 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X18 @ ( setadjoin @ X19 @ emptyset ) ) @ emptyset ) ) ) )
& ( ~ ( in @ X22 @ ( setunion @ ( setadjoin @ ( setadjoin @ esk1_0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ esk1_0 @ ( setadjoin @ esk2_0 @ emptyset ) ) @ emptyset ) ) ) )
| ~ ( in @ X23 @ ( setunion @ ( setadjoin @ ( setadjoin @ esk1_0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ esk1_0 @ ( setadjoin @ esk2_0 @ emptyset ) ) @ emptyset ) ) ) )
| ( ( setadjoin @ ( setadjoin @ esk1_0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ esk1_0 @ ( setadjoin @ esk2_0 @ emptyset ) ) @ emptyset ) )
!= ( setadjoin @ ( setadjoin @ X22 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X22 @ ( setadjoin @ X23 @ emptyset ) ) @ emptyset ) ) ) ) ),
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_5])])])])]) ).
thf(c_0_7,negated_conjecture,
! [X1: $i,X2: $i] :
( ~ ( in @ X1 @ ( setunion @ ( setadjoin @ ( setadjoin @ esk1_0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ esk1_0 @ ( setadjoin @ esk2_0 @ emptyset ) ) @ emptyset ) ) ) )
| ~ ( in @ X2 @ ( setunion @ ( setadjoin @ ( setadjoin @ esk1_0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ esk1_0 @ ( setadjoin @ esk2_0 @ emptyset ) ) @ emptyset ) ) ) )
| ( ( setadjoin @ ( setadjoin @ esk1_0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ esk1_0 @ ( setadjoin @ esk2_0 @ emptyset ) ) @ emptyset ) )
!= ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_8,negated_conjecture,
! [X2: $i,X1: $i] : ( in @ X1 @ ( setunion @ ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i] :
( ( ( setadjoin @ ( setadjoin @ esk1_0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ esk1_0 @ ( setadjoin @ esk2_0 @ emptyset ) ) @ emptyset ) )
!= ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ esk2_0 @ emptyset ) ) @ emptyset ) ) )
| ~ ( in @ X1 @ ( setunion @ ( setadjoin @ ( setadjoin @ esk1_0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ esk1_0 @ ( setadjoin @ esk2_0 @ emptyset ) ) @ emptyset ) ) ) ) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i,X2: $i] : ( in @ X1 @ ( setunion @ ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_11,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_9,c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU619^2 : TPTP v8.2.0. Released v3.7.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n028.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 16:23:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/0.48 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.20/0.49 # Version: 3.1.0-ho
% 0.20/0.49 # Preprocessing class: HSSSSLSSSLSNSFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.49 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.20/0.49 # Starting lpo1_def_fix with 300s (1) cores
% 0.20/0.49 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.20/0.49 # ehoh_best_sine_rwall with pid 19727 completed with status 0
% 0.20/0.49 # Result found by ehoh_best_sine_rwall
% 0.20/0.49 # Preprocessing class: HSSSSLSSSLSNSFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.49 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.20/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.49 # Search class: HUHSS-FFSF21-MSFFMFNN
% 0.20/0.49 # partial match(2): HHUSS-FFSF21-MSFFMFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 181s (1) cores
% 0.20/0.49 # new_ho_10 with pid 19731 completed with status 0
% 0.20/0.49 # Result found by new_ho_10
% 0.20/0.49 # Preprocessing class: HSSSSLSSSLSNSFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.49 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.20/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.49 # Search class: HUHSS-FFSF21-MSFFMFNN
% 0.20/0.49 # partial match(2): HHUSS-FFSF21-MSFFMFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 181s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 11
% 0.20/0.49 # Removed by relevancy pruning/SinE : 7
% 0.20/0.49 # Initial clauses : 3
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 3
% 0.20/0.49 # Processed clauses : 7
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 7
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 4
% 0.20/0.49 # ...of the previous two non-redundant : 3
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 4
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 0
% 0.20/0.49 # ...of those cached : 0
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 4
% 0.20/0.49 # Positive orientable unit clauses : 2
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 0
% 0.20/0.49 # Non-unit-clauses : 2
% 0.20/0.49 # Current number of unprocessed clauses: 1
% 0.20/0.49 # ...number of literals in the above : 2
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 3
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 3
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.49 # Non-unit clause-clause subsumptions : 0
% 0.20/0.49 # Unit Clause-clause subsumption calls : 0
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 2
% 0.20/0.49 # BW rewrite match successes : 0
% 0.20/0.49 # Condensation attempts : 7
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 1115
% 0.20/0.49 # Search garbage collected termcells : 162
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.003 s
% 0.20/0.49 # System time : 0.002 s
% 0.20/0.49 # Total time : 0.005 s
% 0.20/0.49 # Maximum resident set size: 1748 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.005 s
% 0.20/0.49 # System time : 0.004 s
% 0.20/0.49 # Total time : 0.009 s
% 0.20/0.49 # Maximum resident set size: 1700 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------