TSTP Solution File: SEU798^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU798^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:30:20 EDT 2024
% Result : Theorem 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 12
% Syntax : Number of formulae : 21 ( 5 unt; 9 typ; 0 def)
% Number of atoms : 33 ( 2 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 137 ( 7 ~; 4 |; 3 &; 109 @)
% ( 2 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 7 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 : 31 ( 10 ^ 21 !; 0 ?; 31 :)
% 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,
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(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(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(injFuncInInjFuncSet,conjecture,
( dsetconstrI
=> ! [X1: $i,X5: $i,X6: $i] :
( ( in @ X6 @ ( funcSet @ X1 @ X5 ) )
=> ( ( injective @ X1 @ X5 @ X6 )
=> ( in @ X6 @ ( injFuncSet @ X1 @ X5 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',injFuncInInjFuncSet) ).
thf(c_0_3,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_4,plain,
( injFuncSet
= ( ^ [Z0: $i,Z1: $i] :
( dsetconstr @ ( funcSet @ Z0 @ Z1 )
@ ^ [Z2: $i] : ( injective @ Z0 @ Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[injFuncSet]) ).
thf(c_0_5,negated_conjecture,
~ ( ! [X13: $i,X14: $i > $o,X15: $i] :
( ( in @ X15 @ X13 )
=> ( ( X14 @ X15 )
=> ( in @ X15 @ ( dsetconstr @ X13 @ X14 ) ) ) )
=> ! [X1: $i,X5: $i,X6: $i] :
( ( in @ X6 @ ( funcSet @ X1 @ X5 ) )
=> ( ( injective @ X1 @ X5 @ X6 )
=> ( in @ X6
@ ( dsetconstr @ ( funcSet @ X1 @ X5 )
@ ^ [Z0: $i] : ( injective @ X1 @ X5 @ Z0 ) ) ) ) ) ),
inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[injFuncInInjFuncSet]),c_0_3]),c_0_4])]) ).
thf(c_0_6,negated_conjecture,
! [X16: $i,X17: $i > $o,X18: $i] :
( ( ~ ( in @ X18 @ X16 )
| ~ ( X17 @ X18 )
| ( in @ X18 @ ( dsetconstr @ X16 @ X17 ) ) )
& ( in @ esk3_0 @ ( funcSet @ esk1_0 @ esk2_0 ) )
& ( injective @ esk1_0 @ esk2_0 @ esk3_0 )
& ~ ( in @ esk3_0
@ ( dsetconstr @ ( funcSet @ esk1_0 @ esk2_0 )
@ ^ [Z0: $i] : ( injective @ esk1_0 @ esk2_0 @ Z0 ) ) ) ),
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,
~ ( in @ esk3_0 @ ( dsetconstr @ ( funcSet @ esk1_0 @ esk2_0 ) @ ( injective @ esk1_0 @ esk2_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_8,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_9,negated_conjecture,
in @ esk3_0 @ ( funcSet @ esk1_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,negated_conjecture,
injective @ esk1_0 @ esk2_0 @ esk3_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SEU798^2 : TPTP v8.2.0. Released v3.7.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n028.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 18:16:07 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running higher-order theorem proving
% 0.20/0.49 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.20/0.51 # Version: 3.1.0-ho
% 0.20/0.51 # Preprocessing class: HSSSSMSSSLMNSFA.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.51 # Starting ho_unfolding_6 with 300s (1) cores
% 0.20/0.51 # Starting sh4l with 300s (1) cores
% 0.20/0.51 # Starting lpo8_s with 300s (1) cores
% 0.20/0.51 # lpo8_s with pid 12298 completed with status 0
% 0.20/0.51 # Result found by lpo8_s
% 0.20/0.51 # Preprocessing class: HSSSSMSSSLMNSFA.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.51 # Starting ho_unfolding_6 with 300s (1) cores
% 0.20/0.51 # Starting sh4l with 300s (1) cores
% 0.20/0.51 # Starting lpo8_s with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,4.0,,6,20000,1.0)
% 0.20/0.51 # Search class: HHUNF-FFSF22-SSFFMSBN
% 0.20/0.51 # partial match(1): HHUSF-FFSF22-SSFFMSBN
% 0.20/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting new_ho_10 with 181s (1) cores
% 0.20/0.51 # new_ho_10 with pid 12299 completed with status 0
% 0.20/0.51 # Result found by new_ho_10
% 0.20/0.51 # Preprocessing class: HSSSSMSSSLMNSFA.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.51 # Starting ho_unfolding_6 with 300s (1) cores
% 0.20/0.51 # Starting sh4l with 300s (1) cores
% 0.20/0.51 # Starting lpo8_s with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,4.0,,6,20000,1.0)
% 0.20/0.51 # Search class: HHUNF-FFSF22-SSFFMSBN
% 0.20/0.51 # partial match(1): HHUSF-FFSF22-SSFFMSBN
% 0.20/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting new_ho_10 with 181s (1) cores
% 0.20/0.51 # Preprocessing time : 0.001 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Theorem
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 9
% 0.20/0.51 # Removed by relevancy pruning/SinE : 6
% 0.20/0.51 # Initial clauses : 4
% 0.20/0.51 # Removed in clause preprocessing : 0
% 0.20/0.51 # Initial clauses in saturation : 4
% 0.20/0.51 # Processed clauses : 8
% 0.20/0.51 # ...of these trivial : 0
% 0.20/0.51 # ...subsumed : 0
% 0.20/0.51 # ...remaining for further processing : 8
% 0.20/0.51 # Other redundant clauses eliminated : 0
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 0
% 0.20/0.51 # Backward-rewritten : 0
% 0.20/0.51 # Generated clauses : 1
% 0.20/0.51 # ...of the previous two non-redundant : 0
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 0
% 0.20/0.51 # Paramodulations : 1
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 0
% 0.20/0.51 # Disequality decompositions : 0
% 0.20/0.51 # Total rewrite steps : 2
% 0.20/0.51 # ...of those cached : 0
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 4
% 0.20/0.51 # Positive orientable unit clauses : 2
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 1
% 0.20/0.51 # Non-unit-clauses : 1
% 0.20/0.51 # Current number of unprocessed clauses: 0
% 0.20/0.51 # ...number of literals in the above : 0
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 4
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 2
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 2
% 0.20/0.51 # Non-unit clause-clause subsumptions : 0
% 0.20/0.51 # Unit Clause-clause subsumption calls : 0
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 0
% 0.20/0.51 # BW rewrite match successes : 0
% 0.20/0.51 # Condensation attempts : 8
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 537
% 0.20/0.51 # Search garbage collected termcells : 182
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.004 s
% 0.20/0.51 # System time : 0.000 s
% 0.20/0.51 # Total time : 0.005 s
% 0.20/0.51 # Maximum resident set size: 1788 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.007 s
% 0.20/0.51 # System time : 0.001 s
% 0.20/0.51 # Total time : 0.008 s
% 0.20/0.51 # Maximum resident set size: 1712 pages
% 0.20/0.51 % E---3.1 exiting
% 0.20/0.51 % E exiting
%------------------------------------------------------------------------------