TSTP Solution File: SEU508^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU508^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:27:50 EDT 2024
% Result : Theorem 0.16s 0.43s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 22 ( 4 unt; 7 typ; 0 def)
% Number of atoms : 43 ( 0 equ; 0 cnn)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 155 ( 12 ~; 10 |; 4 &; 108 @)
% ( 6 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 18 ( 18 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 41 ( 5 ^ 36 !; 0 ?; 41 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(decl_24,type,
dsetconstrI: $o ).
thf(decl_25,type,
dsetconstrER: $o ).
thf(decl_26,type,
esk1_0: $i ).
thf(decl_27,type,
epred1_0: $i > $o ).
thf(decl_28,type,
esk2_0: $i ).
thf(dsetconstrER,axiom,
( dsetconstrER
<=> ! [X1: $i,X2: $i > $o,X3: $i] :
( ( in @ X3
@ ( dsetconstr @ X1
@ ^ [X4: $i] : ( X2 @ X4 ) ) )
=> ( X2 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dsetconstrER) ).
thf(dsetconstrI,axiom,
( dsetconstrI
<=> ! [X1: $i,X2: $i > $o,X3: $i] :
( ( in @ X3 @ X1 )
=> ( ( X2 @ X3 )
=> ( in @ X3
@ ( dsetconstr @ X1
@ ^ [X4: $i] : ( X2 @ X4 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dsetconstrI) ).
thf(setbeta,conjecture,
( dsetconstrI
=> ( dsetconstrER
=> ! [X1: $i,X2: $i > $o,X3: $i] :
( ( in @ X3 @ X1 )
=> ( ( in @ X3
@ ( dsetconstr @ X1
@ ^ [X4: $i] : ( X2 @ X4 ) ) )
<=> ( X2 @ X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setbeta) ).
thf(c_0_3,plain,
( dsetconstrER
<=> ! [X1: $i,X2: $i > $o,X3: $i] :
( ( in @ X3
@ ( dsetconstr @ X1
@ ^ [Z0: $i] : ( X2 @ Z0 ) ) )
=> ( X2 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[dsetconstrER]) ).
thf(c_0_4,plain,
( dsetconstrI
<=> ! [X1: $i,X2: $i > $o,X3: $i] :
( ( in @ X3 @ X1 )
=> ( ( X2 @ X3 )
=> ( in @ X3
@ ( dsetconstr @ X1
@ ^ [Z0: $i] : ( X2 @ Z0 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[dsetconstrI]) ).
thf(c_0_5,negated_conjecture,
~ ( ! [X14: $i,X15: $i > $o,X16: $i] :
( ( in @ X16 @ X14 )
=> ( ( X15 @ X16 )
=> ( in @ X16 @ ( dsetconstr @ X14 @ X15 ) ) ) )
=> ( ! [X17: $i,X18: $i > $o,X19: $i] :
( ( in @ X19 @ ( dsetconstr @ X17 @ X18 ) )
=> ( X18 @ X19 ) )
=> ! [X1: $i,X2: $i > $o,X3: $i] :
( ( in @ X3 @ X1 )
=> ( ( in @ X3 @ ( dsetconstr @ X1 @ X2 ) )
<=> ( X2 @ X3 ) ) ) ) ),
inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[setbeta])]),c_0_3]),c_0_4])]) ).
thf(c_0_6,negated_conjecture,
! [X20: $i,X21: $i > $o,X22: $i,X23: $i,X24: $i > $o,X25: $i] :
( ( ~ ( in @ X22 @ X20 )
| ~ ( X21 @ X22 )
| ( in @ X22 @ ( dsetconstr @ X20 @ X21 ) ) )
& ( ~ ( in @ X25 @ ( dsetconstr @ X23 @ X24 ) )
| ( X24 @ X25 ) )
& ( in @ esk2_0 @ esk1_0 )
& ( ~ ( in @ esk2_0 @ ( dsetconstr @ esk1_0 @ epred1_0 ) )
| ~ ( epred1_0 @ esk2_0 ) )
& ( ( in @ esk2_0 @ ( dsetconstr @ esk1_0 @ epred1_0 ) )
| ( epred1_0 @ esk2_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_5])])])])]) ).
thf(c_0_7,negated_conjecture,
! [X1: $i,X3: $i,X2: $i > $o] :
( ( X2 @ X1 )
| ~ ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_8,negated_conjecture,
( ( in @ esk2_0 @ ( dsetconstr @ esk1_0 @ epred1_0 ) )
| ( epred1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
( ~ ( in @ esk2_0 @ ( dsetconstr @ esk1_0 @ epred1_0 ) )
| ~ ( epred1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,negated_conjecture,
epred1_0 @ esk2_0,
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_11,negated_conjecture,
~ ( in @ esk2_0 @ ( dsetconstr @ esk1_0 @ epred1_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).
thf(c_0_12,negated_conjecture,
! [X3: $i,X2: $i > $o,X1: $i] :
( ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) )
| ~ ( in @ X1 @ X3 )
| ~ ( X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_13,negated_conjecture,
in @ esk2_0 @ esk1_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SEU508^2 : TPTP v8.2.0. Released v3.7.0.
% 0.00/0.09 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n014.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Sun May 19 17:18:52 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.16/0.41 Running higher-order theorem proving
% 0.16/0.41 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.16/0.43 # Version: 3.1.0-ho
% 0.16/0.43 # Preprocessing class: HSSSSLSSSLMNSSA.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting new_ho_10 with 1500s (5) cores
% 0.16/0.43 # Starting new_bool_2 with 300s (1) cores
% 0.16/0.43 # Starting new_bool_9 with 300s (1) cores
% 0.16/0.43 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.16/0.43 # new_bool_9 with pid 5545 completed with status 0
% 0.16/0.43 # Result found by new_bool_9
% 0.16/0.43 # Preprocessing class: HSSSSLSSSLMNSSA.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting new_ho_10 with 1500s (5) cores
% 0.16/0.43 # Starting new_bool_2 with 300s (1) cores
% 0.16/0.43 # Starting new_bool_9 with 300s (1) cores
% 0.16/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.16/0.43 # Search class: HGHNF-FFSF22-SSSFMSBN
% 0.16/0.43 # partial match(2): HGHSF-FFSF22-SSFFMSBN
% 0.16/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43 # Starting new_ho_10 with 181s (1) cores
% 0.16/0.43 # new_ho_10 with pid 5549 completed with status 0
% 0.16/0.43 # Result found by new_ho_10
% 0.16/0.43 # Preprocessing class: HSSSSLSSSLMNSSA.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting new_ho_10 with 1500s (5) cores
% 0.16/0.43 # Starting new_bool_2 with 300s (1) cores
% 0.16/0.43 # Starting new_bool_9 with 300s (1) cores
% 0.16/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.16/0.43 # Search class: HGHNF-FFSF22-SSSFMSBN
% 0.16/0.43 # partial match(2): HGHSF-FFSF22-SSFFMSBN
% 0.16/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43 # Starting new_ho_10 with 181s (1) cores
% 0.16/0.43 # Preprocessing time : 0.001 s
% 0.16/0.43 # Presaturation interreduction done
% 0.16/0.43
% 0.16/0.43 # Proof found!
% 0.16/0.43 # SZS status Theorem
% 0.16/0.43 # SZS output start CNFRefutation
% See solution above
% 0.16/0.43 # Parsed axioms : 7
% 0.16/0.43 # Removed by relevancy pruning/SinE : 4
% 0.16/0.43 # Initial clauses : 5
% 0.16/0.43 # Removed in clause preprocessing : 0
% 0.16/0.43 # Initial clauses in saturation : 5
% 0.16/0.43 # Processed clauses : 12
% 0.16/0.43 # ...of these trivial : 0
% 0.16/0.43 # ...subsumed : 0
% 0.16/0.43 # ...remaining for further processing : 12
% 0.16/0.43 # Other redundant clauses eliminated : 0
% 0.16/0.43 # Clauses deleted for lack of memory : 0
% 0.16/0.43 # Backward-subsumed : 0
% 0.16/0.43 # Backward-rewritten : 2
% 0.16/0.43 # Generated clauses : 4
% 0.16/0.43 # ...of the previous two non-redundant : 2
% 0.16/0.43 # ...aggressively subsumed : 0
% 0.16/0.43 # Contextual simplify-reflections : 0
% 0.16/0.43 # Paramodulations : 4
% 0.16/0.43 # Factorizations : 0
% 0.16/0.43 # NegExts : 0
% 0.16/0.43 # Equation resolutions : 0
% 0.16/0.43 # Disequality decompositions : 0
% 0.16/0.43 # Total rewrite steps : 4
% 0.16/0.43 # ...of those cached : 2
% 0.16/0.43 # Propositional unsat checks : 0
% 0.16/0.43 # Propositional check models : 0
% 0.16/0.43 # Propositional check unsatisfiable : 0
% 0.16/0.43 # Propositional clauses : 0
% 0.16/0.43 # Propositional clauses after purity: 0
% 0.16/0.43 # Propositional unsat core size : 0
% 0.16/0.43 # Propositional preprocessing time : 0.000
% 0.16/0.43 # Propositional encoding time : 0.000
% 0.16/0.43 # Propositional solver time : 0.000
% 0.16/0.43 # Success case prop preproc time : 0.000
% 0.16/0.43 # Success case prop encoding time : 0.000
% 0.16/0.43 # Success case prop solver time : 0.000
% 0.16/0.43 # Current number of processed clauses : 5
% 0.16/0.43 # Positive orientable unit clauses : 2
% 0.16/0.43 # Positive unorientable unit clauses: 0
% 0.16/0.43 # Negative unit clauses : 1
% 0.16/0.43 # Non-unit-clauses : 2
% 0.16/0.43 # Current number of unprocessed clauses: 0
% 0.16/0.43 # ...number of literals in the above : 0
% 0.16/0.43 # Current number of archived formulas : 0
% 0.16/0.43 # Current number of archived clauses : 7
% 0.16/0.43 # Clause-clause subsumption calls (NU) : 2
% 0.16/0.43 # Rec. Clause-clause subsumption calls : 2
% 0.16/0.43 # Non-unit clause-clause subsumptions : 0
% 0.16/0.43 # Unit Clause-clause subsumption calls : 0
% 0.16/0.43 # Rewrite failures with RHS unbound : 0
% 0.16/0.43 # BW rewrite match attempts : 1
% 0.16/0.43 # BW rewrite match successes : 1
% 0.16/0.43 # Condensation attempts : 12
% 0.16/0.43 # Condensation successes : 0
% 0.16/0.43 # Termbank termtop insertions : 791
% 0.16/0.43 # Search garbage collected termcells : 298
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.004 s
% 0.16/0.43 # System time : 0.002 s
% 0.16/0.43 # Total time : 0.005 s
% 0.16/0.43 # Maximum resident set size: 1776 pages
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.006 s
% 0.16/0.43 # System time : 0.004 s
% 0.16/0.43 # Total time : 0.010 s
% 0.16/0.43 # Maximum resident set size: 1704 pages
% 0.16/0.43 % E---3.1 exiting
% 0.16/0.43 % E exiting
%------------------------------------------------------------------------------