TSTP Solution File: SEU802^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU802^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:24 EDT 2024
% Result : Theorem 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 16
% Syntax : Number of formulae : 32 ( 11 unt; 12 typ; 0 def)
% Number of atoms : 58 ( 16 equ; 0 cnn)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 223 ( 13 ~; 9 |; 10 &; 175 @)
% ( 2 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 25 ( 25 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 6 con; 0-4 aty)
% Number of variables : 68 ( 18 ^ 43 !; 7 ?; 68 :)
% 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,
ap: $i > $i > $i > $i > $i ).
thf(decl_27,type,
surjective: $i > $i > $i > $o ).
thf(decl_28,type,
surjFuncSet: $i > $i > $i ).
thf(decl_29,type,
esk1_0: $i ).
thf(decl_30,type,
esk2_0: $i ).
thf(decl_31,type,
esk3_0: $i ).
thf(decl_32,type,
esk4_0: $i ).
thf(decl_33,type,
esk5_4: $i > $i > $i > $i > $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(surjective,axiom,
( surjective
= ( ^ [X1: $i,X5: $i,X6: $i] :
! [X3: $i] :
( ( in @ X3 @ X5 )
=> ? [X4: $i] :
( ( in @ X4 @ X1 )
& ( ( ap @ X1 @ X5 @ X6 @ X4 )
= X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',surjective) ).
thf(surjFuncSetFuncSurj,conjecture,
( dsetconstrER
=> ! [X3: $i,X4: $i,X6: $i] :
( ( in @ X6 @ ( surjFuncSet @ X3 @ X4 ) )
=> ( surjective @ X3 @ X4 @ X6 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',surjFuncSetFuncSurj) ).
thf(surjFuncSet,axiom,
( surjFuncSet
= ( ^ [X1: $i,X5: $i] :
( dsetconstr @ ( funcSet @ X1 @ X5 )
@ ^ [X6: $i] : ( surjective @ X1 @ X5 @ X6 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',surjFuncSet) ).
thf(c_0_4,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_5,plain,
( surjective
= ( ^ [Z0: $i,Z1: $i,Z2: $i] :
! [X3: $i] :
( ( in @ X3 @ Z1 )
=> ? [X4: $i] :
( ( in @ X4 @ Z0 )
& ( ( ap @ Z0 @ Z1 @ Z2 @ X4 )
= X3 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[surjective]) ).
thf(c_0_6,negated_conjecture,
~ ( ! [X15: $i,X16: $i > $o,X17: $i] :
( ( in @ X17 @ ( dsetconstr @ X15 @ X16 ) )
=> ( X16 @ X17 ) )
=> ! [X3: $i,X4: $i,X6: $i] :
( ( in @ X6 @ ( surjFuncSet @ X3 @ X4 ) )
=> ! [X18: $i] :
( ( in @ X18 @ X4 )
=> ? [X19: $i] :
( ( in @ X19 @ X3 )
& ( ( ap @ X3 @ X4 @ X6 @ X19 )
= X18 ) ) ) ) ),
inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[surjFuncSetFuncSurj]),c_0_4]),c_0_5])]) ).
thf(c_0_7,plain,
( surjFuncSet
= ( ^ [Z0: $i,Z1: $i] :
( dsetconstr @ ( funcSet @ Z0 @ Z1 )
@ ^ [Z2: $i] :
! [X13: $i] :
( ( in @ X13 @ Z1 )
=> ? [X14: $i] :
( ( in @ X14 @ Z0 )
& ( ( ap @ Z0 @ Z1 @ Z2 @ X14 )
= X13 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[surjFuncSet]),c_0_5]) ).
thf(c_0_8,negated_conjecture,
! [X20: $i,X21: $i > $o,X22: $i,X27: $i] :
( ( ~ ( in @ X22 @ ( dsetconstr @ X20 @ X21 ) )
| ( X21 @ X22 ) )
& ( in @ esk3_0 @ ( surjFuncSet @ esk1_0 @ esk2_0 ) )
& ( in @ esk4_0 @ esk2_0 )
& ( ~ ( in @ X27 @ esk1_0 )
| ( ( ap @ esk1_0 @ esk2_0 @ esk3_0 @ X27 )
!= esk4_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_6])])])])]) ).
thf(c_0_9,plain,
( surjFuncSet
= ( ^ [Z0: $i,Z1: $i] :
( dsetconstr @ ( funcSet @ Z0 @ Z1 )
@ ^ [Z2: $i] :
! [X38: $i] :
( ( in @ X38 @ Z1 )
=> ? [X39: $i] :
( ( in @ X39 @ Z0 )
& ( ( ap @ Z0 @ Z1 @ Z2 @ X39 )
= X38 ) ) ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i,X3: $i,X2: $i > $o] :
( ( X2 @ X1 )
| ~ ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_11,plain,
! [X1: $i,X3: $i] :
( ( dsetconstr @ ( funcSet @ X1 @ X3 )
@ ^ [Z0: $i] :
! [X40: $i] :
( ( in @ X40 @ X3 )
=> ? [X41: $i] :
( ( in @ X41 @ X1 )
& ( ( ap @ X1 @ X3 @ Z0 @ X41 )
= X40 ) ) ) )
= ( surjFuncSet @ X1 @ X3 ) ),
inference(arg_cong,[status(thm)],[c_0_9]) ).
thf(c_0_12,negated_conjecture,
! [X4: $i,X3: $i,X1: $i] :
( ! [X42: $i] :
( ( in @ X42 @ X1 )
=> ? [X43: $i] :
( ( in @ X43 @ X3 )
& ( ( ap @ X3 @ X1 @ X4 @ X43 )
= X42 ) ) )
| ~ ( in @ X4 @ ( surjFuncSet @ X3 @ X1 ) ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i] :
( ~ ( in @ X1 @ esk1_0 )
| ( ( ap @ esk1_0 @ esk2_0 @ esk3_0 @ X1 )
!= esk4_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i,X5: $i,X4: $i,X3: $i] :
( ( ( ap @ X1 @ X3 @ X4 @ ( esk5_4 @ X4 @ X1 @ X3 @ X5 ) )
= X5 )
| ~ ( in @ X4 @ ( surjFuncSet @ X1 @ X3 ) )
| ~ ( in @ X5 @ X3 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_12]) ).
thf(c_0_15,negated_conjecture,
in @ esk3_0 @ ( surjFuncSet @ esk1_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_16,negated_conjecture,
in @ esk4_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_17,negated_conjecture,
~ ( in @ ( esk5_4 @ esk3_0 @ esk1_0 @ esk2_0 @ esk4_0 ) @ esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])])]),c_0_16])]) ).
thf(c_0_18,negated_conjecture,
! [X1: $i,X3: $i,X5: $i,X4: $i] :
( ( in @ ( esk5_4 @ X1 @ X3 @ X4 @ X5 ) @ X3 )
| ~ ( in @ X1 @ ( surjFuncSet @ X3 @ X4 ) )
| ~ ( in @ X5 @ X4 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_12]) ).
thf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_15]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU802^2 : TPTP v8.2.0. Released v3.7.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n026.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 17:33:08 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running higher-order theorem proving
% 0.20/0.47 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.48 # Version: 3.1.0-ho
% 0.20/0.48 # Preprocessing class: HSSSSMSSSLMNSFA.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.48 # Starting ho_unfolding_6 with 300s (1) cores
% 0.20/0.48 # Starting sh4l with 300s (1) cores
% 0.20/0.48 # Starting lpo8_s with 300s (1) cores
% 0.20/0.48 # ho_unfolding_6 with pid 2139 completed with status 0
% 0.20/0.48 # Result found by ho_unfolding_6
% 0.20/0.48 # Preprocessing class: HSSSSMSSSLMNSFA.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.48 # Starting ho_unfolding_6 with 300s (1) cores
% 0.20/0.48 # No SInE strategy applied
% 0.20/0.48 # Search class: HHHSF-FFSS32-DSFFMSBN
% 0.20/0.48 # partial match(2): HHUSF-FFSS32-SSFFMSBN
% 0.20/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting new_ho_10 with 181s (1) cores
% 0.20/0.48 # new_ho_10 with pid 2142 completed with status 0
% 0.20/0.48 # Result found by new_ho_10
% 0.20/0.48 # Preprocessing class: HSSSSMSSSLMNSFA.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.48 # Starting ho_unfolding_6 with 300s (1) cores
% 0.20/0.48 # No SInE strategy applied
% 0.20/0.48 # Search class: HHHSF-FFSS32-DSFFMSBN
% 0.20/0.48 # partial match(2): HHUSF-FFSS32-SSFFMSBN
% 0.20/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting new_ho_10 with 181s (1) cores
% 0.20/0.48 # Preprocessing time : 0.001 s
% 0.20/0.48 # Presaturation interreduction done
% 0.20/0.48
% 0.20/0.48 # Proof found!
% 0.20/0.48 # SZS status Theorem
% 0.20/0.48 # SZS output start CNFRefutation
% See solution above
% 0.20/0.48 # Parsed axioms : 11
% 0.20/0.48 # Removed by relevancy pruning/SinE : 0
% 0.20/0.48 # Initial clauses : 12
% 0.20/0.48 # Removed in clause preprocessing : 7
% 0.20/0.48 # Initial clauses in saturation : 5
% 0.20/0.48 # Processed clauses : 17
% 0.20/0.48 # ...of these trivial : 0
% 0.20/0.48 # ...subsumed : 0
% 0.20/0.48 # ...remaining for further processing : 17
% 0.20/0.48 # Other redundant clauses eliminated : 1
% 0.20/0.48 # Clauses deleted for lack of memory : 0
% 0.20/0.48 # Backward-subsumed : 0
% 0.20/0.48 # Backward-rewritten : 0
% 0.20/0.48 # Generated clauses : 12
% 0.20/0.48 # ...of the previous two non-redundant : 9
% 0.20/0.48 # ...aggressively subsumed : 0
% 0.20/0.48 # Contextual simplify-reflections : 0
% 0.20/0.48 # Paramodulations : 6
% 0.20/0.48 # Factorizations : 0
% 0.20/0.48 # NegExts : 0
% 0.20/0.48 # Equation resolutions : 1
% 0.20/0.48 # Disequality decompositions : 0
% 0.20/0.48 # Total rewrite steps : 5
% 0.20/0.48 # ...of those cached : 2
% 0.20/0.48 # Propositional unsat checks : 0
% 0.20/0.48 # Propositional check models : 0
% 0.20/0.48 # Propositional check unsatisfiable : 0
% 0.20/0.48 # Propositional clauses : 0
% 0.20/0.48 # Propositional clauses after purity: 0
% 0.20/0.48 # Propositional unsat core size : 0
% 0.20/0.48 # Propositional preprocessing time : 0.000
% 0.20/0.48 # Propositional encoding time : 0.000
% 0.20/0.48 # Propositional solver time : 0.000
% 0.20/0.48 # Success case prop preproc time : 0.000
% 0.20/0.48 # Success case prop encoding time : 0.000
% 0.20/0.48 # Success case prop solver time : 0.000
% 0.20/0.48 # Current number of processed clauses : 11
% 0.20/0.48 # Positive orientable unit clauses : 5
% 0.20/0.48 # Positive unorientable unit clauses: 0
% 0.20/0.48 # Negative unit clauses : 1
% 0.20/0.48 # Non-unit-clauses : 5
% 0.20/0.48 # Current number of unprocessed clauses: 2
% 0.20/0.48 # ...number of literals in the above : 7
% 0.20/0.48 # Current number of archived formulas : 0
% 0.20/0.48 # Current number of archived clauses : 6
% 0.20/0.48 # Clause-clause subsumption calls (NU) : 9
% 0.20/0.48 # Rec. Clause-clause subsumption calls : 9
% 0.20/0.48 # Non-unit clause-clause subsumptions : 0
% 0.20/0.48 # Unit Clause-clause subsumption calls : 1
% 0.20/0.48 # Rewrite failures with RHS unbound : 0
% 0.20/0.48 # BW rewrite match attempts : 1
% 0.20/0.48 # BW rewrite match successes : 0
% 0.20/0.48 # Condensation attempts : 17
% 0.20/0.48 # Condensation successes : 0
% 0.20/0.48 # Termbank termtop insertions : 1261
% 0.20/0.48 # Search garbage collected termcells : 237
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.006 s
% 0.20/0.48 # System time : 0.001 s
% 0.20/0.48 # Total time : 0.007 s
% 0.20/0.48 # Maximum resident set size: 1764 pages
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.009 s
% 0.20/0.48 # System time : 0.001 s
% 0.20/0.48 # Total time : 0.010 s
% 0.20/0.48 # Maximum resident set size: 1712 pages
% 0.20/0.48 % E---3.1 exiting
% 0.20/0.48 % E exiting
%------------------------------------------------------------------------------