TSTP Solution File: SEU603^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU603^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:30 EDT 2024
% Result : Theorem 0.17s 0.46s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of formulae : 21 ( 8 unt; 7 typ; 0 def)
% Number of atoms : 27 ( 4 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 100 ( 11 ~; 3 |; 2 &; 75 @)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 38 ( 12 ^ 26 !; 0 ?; 38 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(decl_24,type,
dsetconstrER: $o ).
thf(decl_25,type,
setminus: $i > $i > $i ).
thf(decl_26,type,
esk1_0: $i ).
thf(decl_27,type,
esk2_0: $i ).
thf(decl_28,type,
esk3_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/sandbox2/benchmark/theBenchmark.p',dsetconstrER) ).
thf(setminusER,conjecture,
( dsetconstrER
=> ! [X1: $i,X5: $i,X3: $i] :
( ( in @ X3 @ ( setminus @ X1 @ X5 ) )
=> ~ ( in @ X3 @ X5 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setminusER) ).
thf(setminus,axiom,
( setminus
= ( ^ [X1: $i,X5: $i] :
( dsetconstr @ X1
@ ^ [X3: $i] :
~ ( in @ X3 @ X5 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setminus) ).
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,negated_conjecture,
~ ( ! [X12: $i,X13: $i > $o,X14: $i] :
( ( in @ X14 @ ( dsetconstr @ X12 @ X13 ) )
=> ( X13 @ X14 ) )
=> ! [X1: $i,X5: $i,X3: $i] :
( ( in @ X3 @ ( setminus @ X1 @ X5 ) )
=> ~ ( in @ X3 @ X5 ) ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[setminusER]),c_0_3])])]) ).
thf(c_0_5,plain,
( setminus
= ( ^ [Z0: $i,Z1: $i] :
( dsetconstr @ Z0
@ ^ [Z2: $i] :
~ ( in @ Z2 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[setminus]) ).
thf(c_0_6,negated_conjecture,
! [X15: $i,X16: $i > $o,X17: $i] :
( ( ~ ( in @ X17 @ ( dsetconstr @ X15 @ X16 ) )
| ( X16 @ X17 ) )
& ( in @ esk3_0 @ ( setminus @ esk1_0 @ esk2_0 ) )
& ( in @ esk3_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_4])])])])]) ).
thf(c_0_7,plain,
( setminus
= ( ^ [Z0: $i,Z1: $i] :
( dsetconstr @ Z0
@ ^ [Z2: $i] :
~ ( in @ Z2 @ Z1 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,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_9,plain,
! [X1: $i,X3: $i] :
( ( dsetconstr @ X1
@ ^ [Z0: $i] :
~ ( in @ Z0 @ X3 ) )
= ( setminus @ X1 @ X3 ) ),
inference(arg_cong,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i,X3: $i,X4: $i] :
( ~ ( in @ X1 @ ( setminus @ X3 @ X4 ) )
| ~ ( in @ X1 @ X4 ) ),
inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9])]) ).
thf(c_0_11,negated_conjecture,
in @ esk3_0 @ ( setminus @ esk1_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_12,negated_conjecture,
in @ esk3_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SEU603^2 : TPTP v8.2.0. Released v3.7.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n011.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Sun May 19 15:36:08 EDT 2024
% 0.10/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: HSSSSMSSSLMNSFA.
% 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 ho_unfolding_6 with 300s (1) cores
% 0.17/0.46 # Starting sh4l with 300s (1) cores
% 0.17/0.46 # Starting lpo8_s with 300s (1) cores
% 0.17/0.46 # ho_unfolding_6 with pid 18352 completed with status 0
% 0.17/0.46 # Result found by ho_unfolding_6
% 0.17/0.46 # Preprocessing class: HSSSSMSSSLMNSFA.
% 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 ho_unfolding_6 with 300s (1) cores
% 0.17/0.46 # No SInE strategy applied
% 0.17/0.46 # Search class: HHUSF-FFSS22-DSFFMSBN
% 0.17/0.46 # partial match(2): HHUSF-FFSF22-SSFFMSBN
% 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 18355 completed with status 0
% 0.17/0.46 # Result found by new_ho_10
% 0.17/0.46 # Preprocessing class: HSSSSMSSSLMNSFA.
% 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 ho_unfolding_6 with 300s (1) cores
% 0.17/0.46 # No SInE strategy applied
% 0.17/0.46 # Search class: HHUSF-FFSS22-DSFFMSBN
% 0.17/0.46 # partial match(2): HHUSF-FFSF22-SSFFMSBN
% 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 : 7
% 0.17/0.46 # Removed by relevancy pruning/SinE : 0
% 0.17/0.46 # Initial clauses : 8
% 0.17/0.46 # Removed in clause preprocessing : 4
% 0.17/0.46 # Initial clauses in saturation : 4
% 0.17/0.46 # Processed clauses : 11
% 0.17/0.46 # ...of these trivial : 0
% 0.17/0.46 # ...subsumed : 0
% 0.17/0.46 # ...remaining for further processing : 11
% 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 : 5
% 0.17/0.46 # ...of the previous two non-redundant : 4
% 0.17/0.46 # ...aggressively subsumed : 0
% 0.17/0.46 # Contextual simplify-reflections : 0
% 0.17/0.46 # Paramodulations : 2
% 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 : 1
% 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 : 5
% 0.17/0.46 # Positive unorientable unit clauses: 0
% 0.17/0.46 # Negative unit clauses : 0
% 0.17/0.46 # Non-unit-clauses : 2
% 0.17/0.46 # Current number of unprocessed clauses: 1
% 0.17/0.46 # ...number of literals in the above : 1
% 0.17/0.46 # Current number of archived formulas : 0
% 0.17/0.46 # Current number of archived clauses : 4
% 0.17/0.46 # Clause-clause subsumption calls (NU) : 0
% 0.17/0.46 # Rec. Clause-clause subsumption calls : 0
% 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 : 1
% 0.17/0.46 # BW rewrite match successes : 0
% 0.17/0.46 # Condensation attempts : 11
% 0.17/0.46 # Condensation successes : 0
% 0.17/0.46 # Termbank termtop insertions : 526
% 0.17/0.46 # Search garbage collected termcells : 135
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.005 s
% 0.17/0.46 # System time : 0.001 s
% 0.17/0.46 # Total time : 0.006 s
% 0.17/0.46 # Maximum resident set size: 1764 pages
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.006 s
% 0.17/0.46 # System time : 0.003 s
% 0.17/0.46 # Total time : 0.009 s
% 0.17/0.46 # Maximum resident set size: 1708 pages
% 0.17/0.46 % E---3.1 exiting
% 0.17/0.46 % E exiting
%------------------------------------------------------------------------------