TSTP Solution File: SEU800^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU800^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:22 EDT 2024
% Result : Theorem 0.16s 0.42s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of formulae : 23 ( 8 unt; 9 typ; 0 def)
% Number of atoms : 27 ( 4 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 115 ( 6 ~; 3 |; 2 &; 95 @)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 17 ( 17 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 37 ( 7 ^ 30 !; 0 ?; 37 :)
% 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,
funcSet: $i > $i > $i ).
thf(decl_26,type,
injective: $i > $i > $i > $o ).
thf(decl_27,type,
injFuncSet: $i > $i > $i ).
thf(decl_28,type,
esk1_0: $i ).
thf(decl_29,type,
esk2_0: $i ).
thf(decl_30,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/sandbox/benchmark/theBenchmark.p',dsetconstrER) ).
thf(injFuncSetFuncInj,conjecture,
( dsetconstrER
=> ! [X3: $i,X4: $i,X6: $i] :
( ( in @ X6 @ ( injFuncSet @ X3 @ X4 ) )
=> ( injective @ X3 @ X4 @ X6 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',injFuncSetFuncInj) ).
thf(injFuncSet,axiom,
( injFuncSet
= ( ^ [X1: $i,X5: $i] :
( dsetconstr @ ( funcSet @ X1 @ X5 )
@ ^ [X6: $i] : ( injective @ X1 @ X5 @ X6 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',injFuncSet) ).
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,
~ ( ! [X13: $i,X14: $i > $o,X15: $i] :
( ( in @ X15 @ ( dsetconstr @ X13 @ X14 ) )
=> ( X14 @ X15 ) )
=> ! [X3: $i,X4: $i,X6: $i] :
( ( in @ X6 @ ( injFuncSet @ X3 @ X4 ) )
=> ( injective @ X3 @ X4 @ X6 ) ) ),
inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[injFuncSetFuncInj]),c_0_3])]) ).
thf(c_0_5,plain,
! [X16: $i,X17: $i] :
( ( injFuncSet @ X16 @ X17 )
= ( dsetconstr @ ( funcSet @ X16 @ X17 )
@ ^ [Z0: $i] : ( injective @ X16 @ X17 @ Z0 ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[injFuncSet])]) ).
thf(c_0_6,negated_conjecture,
! [X20: $i,X21: $i > $o,X22: $i] :
( ( ~ ( in @ X22 @ ( dsetconstr @ X20 @ X21 ) )
| ( X21 @ X22 ) )
& ( in @ esk3_0 @ ( injFuncSet @ esk1_0 @ esk2_0 ) )
& ~ ( injective @ esk1_0 @ esk2_0 @ esk3_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,
! [X18: $i,X19: $i] :
( ( injFuncSet @ X18 @ X19 )
= ( dsetconstr @ ( funcSet @ X18 @ X19 )
@ ^ [Z0: $i] : ( injective @ X18 @ X19 @ Z0 ) ) ),
inference(variable_rename,[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] :
( ( injFuncSet @ X1 @ X3 )
= ( dsetconstr @ ( funcSet @ X1 @ X3 ) @ ( injective @ X1 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i,X4: $i,X3: $i] :
( ( injective @ X1 @ X3 @ X4 )
| ~ ( in @ X4 @ ( injFuncSet @ X1 @ X3 ) ) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_11,negated_conjecture,
in @ esk3_0 @ ( injFuncSet @ esk1_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_12,negated_conjecture,
~ ( injective @ esk1_0 @ esk2_0 @ esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_13,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SEU800^2 : TPTP v8.2.0. Released v3.7.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n006.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.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Sun May 19 18:00:52 EDT 2024
% 0.10/0.31 % 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.42 # Version: 3.1.0-ho
% 0.16/0.42 # Preprocessing class: HSSSSMSSSLMNSFA.
% 0.16/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42 # Starting new_ho_10 with 1500s (5) cores
% 0.16/0.42 # Starting ho_unfolding_6 with 300s (1) cores
% 0.16/0.42 # Starting sh4l with 300s (1) cores
% 0.16/0.42 # Starting lpo8_s with 300s (1) cores
% 0.16/0.42 # new_ho_10 with pid 18133 completed with status 0
% 0.16/0.42 # Result found by new_ho_10
% 0.16/0.42 # Preprocessing class: HSSSSMSSSLMNSFA.
% 0.16/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42 # Starting new_ho_10 with 1500s (5) cores
% 0.16/0.42 # No SInE strategy applied
% 0.16/0.42 # Search class: HHUSF-FFSF22-SSFFMSBN
% 0.16/0.42 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.42 # Starting new_ho_10 with 901s (1) cores
% 0.16/0.42 # Starting ho_unfolding_6 with 151s (1) cores
% 0.16/0.42 # Starting sh4l with 151s (1) cores
% 0.16/0.42 # Starting lpo8_s with 151s (1) cores
% 0.16/0.42 # Starting sh2lt with 146s (1) cores
% 0.16/0.42 # new_ho_10 with pid 18137 completed with status 0
% 0.16/0.42 # Result found by new_ho_10
% 0.16/0.42 # Preprocessing class: HSSSSMSSSLMNSFA.
% 0.16/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42 # Starting new_ho_10 with 1500s (5) cores
% 0.16/0.42 # No SInE strategy applied
% 0.16/0.42 # Search class: HHUSF-FFSF22-SSFFMSBN
% 0.16/0.42 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.42 # Starting new_ho_10 with 901s (1) cores
% 0.16/0.42 # Preprocessing time : 0.001 s
% 0.16/0.42 # Presaturation interreduction done
% 0.16/0.42
% 0.16/0.42 # Proof found!
% 0.16/0.42 # SZS status Theorem
% 0.16/0.42 # SZS output start CNFRefutation
% See solution above
% 0.16/0.42 # Parsed axioms : 9
% 0.16/0.42 # Removed by relevancy pruning/SinE : 0
% 0.16/0.42 # Initial clauses : 10
% 0.16/0.42 # Removed in clause preprocessing : 6
% 0.16/0.42 # Initial clauses in saturation : 4
% 0.16/0.42 # Processed clauses : 9
% 0.16/0.42 # ...of these trivial : 0
% 0.16/0.42 # ...subsumed : 0
% 0.16/0.42 # ...remaining for further processing : 9
% 0.16/0.42 # Other redundant clauses eliminated : 0
% 0.16/0.42 # Clauses deleted for lack of memory : 0
% 0.16/0.42 # Backward-subsumed : 0
% 0.16/0.42 # Backward-rewritten : 0
% 0.16/0.42 # Generated clauses : 2
% 0.16/0.42 # ...of the previous two non-redundant : 1
% 0.16/0.42 # ...aggressively subsumed : 0
% 0.16/0.42 # Contextual simplify-reflections : 0
% 0.16/0.42 # Paramodulations : 2
% 0.16/0.42 # Factorizations : 0
% 0.16/0.42 # NegExts : 0
% 0.16/0.42 # Equation resolutions : 0
% 0.16/0.42 # Disequality decompositions : 0
% 0.16/0.42 # Total rewrite steps : 0
% 0.16/0.42 # ...of those cached : 0
% 0.16/0.42 # Propositional unsat checks : 0
% 0.16/0.42 # Propositional check models : 0
% 0.16/0.42 # Propositional check unsatisfiable : 0
% 0.16/0.42 # Propositional clauses : 0
% 0.16/0.42 # Propositional clauses after purity: 0
% 0.16/0.42 # Propositional unsat core size : 0
% 0.16/0.42 # Propositional preprocessing time : 0.000
% 0.16/0.42 # Propositional encoding time : 0.000
% 0.16/0.42 # Propositional solver time : 0.000
% 0.16/0.42 # Success case prop preproc time : 0.000
% 0.16/0.42 # Success case prop encoding time : 0.000
% 0.16/0.42 # Success case prop solver time : 0.000
% 0.16/0.42 # Current number of processed clauses : 5
% 0.16/0.42 # Positive orientable unit clauses : 2
% 0.16/0.42 # Positive unorientable unit clauses: 0
% 0.16/0.42 # Negative unit clauses : 1
% 0.16/0.42 # Non-unit-clauses : 2
% 0.16/0.42 # Current number of unprocessed clauses: 0
% 0.16/0.42 # ...number of literals in the above : 0
% 0.16/0.42 # Current number of archived formulas : 0
% 0.16/0.42 # Current number of archived clauses : 4
% 0.16/0.42 # Clause-clause subsumption calls (NU) : 0
% 0.16/0.42 # Rec. Clause-clause subsumption calls : 0
% 0.16/0.42 # Non-unit clause-clause subsumptions : 0
% 0.16/0.42 # Unit Clause-clause subsumption calls : 0
% 0.16/0.42 # Rewrite failures with RHS unbound : 0
% 0.16/0.42 # BW rewrite match attempts : 0
% 0.16/0.42 # BW rewrite match successes : 0
% 0.16/0.42 # Condensation attempts : 9
% 0.16/0.42 # Condensation successes : 0
% 0.16/0.42 # Termbank termtop insertions : 526
% 0.16/0.42 # Search garbage collected termcells : 153
% 0.16/0.42
% 0.16/0.42 # -------------------------------------------------
% 0.16/0.42 # User time : 0.002 s
% 0.16/0.42 # System time : 0.002 s
% 0.16/0.42 # Total time : 0.004 s
% 0.16/0.42 # Maximum resident set size: 1792 pages
% 0.16/0.42
% 0.16/0.42 # -------------------------------------------------
% 0.16/0.42 # User time : 0.006 s
% 0.16/0.42 # System time : 0.005 s
% 0.16/0.42 # Total time : 0.011 s
% 0.16/0.42 # Maximum resident set size: 1712 pages
% 0.16/0.42 % E---3.1 exiting
% 0.16/0.42 % E exiting
%------------------------------------------------------------------------------