TSTP Solution File: SEU612^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU612^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:34 EDT 2024
% Result : Theorem 0.14s 0.43s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 16
% Syntax : Number of formulae : 32 ( 9 unt; 10 typ; 0 def)
% Number of atoms : 66 ( 4 equ; 0 cnn)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 255 ( 29 ~; 19 |; 6 &; 181 @)
% ( 4 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 17 ( 17 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 6 con; 0-3 aty)
% Number of variables : 61 ( 7 ^ 54 !; 0 ?; 61 :)
% 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,
binunion: $i > $i > $i ).
thf(decl_26,type,
binunionIL: $o ).
thf(decl_27,type,
symdiff: $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(decl_31,type,
epred1_2: $i > $i > $i > $o ).
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/sandbox2/benchmark/theBenchmark.p',dsetconstrI) ).
thf(symdiffI1,conjecture,
( dsetconstrI
=> ( binunionIL
=> ! [X1: $i,X5: $i,X3: $i] :
( ( in @ X3 @ X1 )
=> ( ~ ( in @ X3 @ X5 )
=> ( in @ X3 @ ( symdiff @ X1 @ X5 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symdiffI1) ).
thf(binunionIL,axiom,
( binunionIL
<=> ! [X1: $i,X5: $i,X3: $i] :
( ( in @ X3 @ X1 )
=> ( in @ X3 @ ( binunion @ X1 @ X5 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binunionIL) ).
thf(symdiff,axiom,
( symdiff
= ( ^ [X1: $i,X5: $i] :
( dsetconstr @ ( binunion @ X1 @ X5 )
@ ^ [X3: $i] :
( ~ ( in @ X3 @ X1 )
| ~ ( in @ X3 @ X5 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symdiff) ).
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,
~ ( ! [X15: $i,X16: $i > $o,X17: $i] :
( ( in @ X17 @ X15 )
=> ( ( X16 @ X17 )
=> ( in @ X17 @ ( dsetconstr @ X15 @ X16 ) ) ) )
=> ( ! [X18: $i,X19: $i,X20: $i] :
( ( in @ X20 @ X18 )
=> ( in @ X20 @ ( binunion @ X18 @ X19 ) ) )
=> ! [X1: $i,X5: $i,X3: $i] :
( ( in @ X3 @ X1 )
=> ( ~ ( in @ X3 @ X5 )
=> ( in @ X3 @ ( symdiff @ X1 @ X5 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[symdiffI1]),c_0_4]),binunionIL])])]) ).
thf(c_0_6,plain,
! [X21: $i,X22: $i] :
( ( symdiff @ X21 @ X22 )
= ( dsetconstr @ ( binunion @ X21 @ X22 )
@ ^ [Z0: $i] :
( ~ ( in @ Z0 @ X21 )
| ~ ( in @ Z0 @ X22 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[symdiff])]) ).
thf(c_0_7,negated_conjecture,
! [X25: $i,X26: $i > $o,X27: $i,X28: $i,X29: $i,X30: $i] :
( ( ~ ( in @ X27 @ X25 )
| ~ ( X26 @ X27 )
| ( in @ X27 @ ( dsetconstr @ X25 @ X26 ) ) )
& ( ~ ( in @ X30 @ X28 )
| ( in @ X30 @ ( binunion @ X28 @ X29 ) ) )
& ( in @ esk3_0 @ esk1_0 )
& ~ ( in @ esk3_0 @ esk2_0 )
& ~ ( in @ esk3_0 @ ( symdiff @ esk1_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_8,plain,
! [X23: $i,X24: $i] :
( ( symdiff @ X23 @ X24 )
= ( dsetconstr @ ( binunion @ X23 @ X24 )
@ ^ [Z0: $i] :
( ~ ( in @ Z0 @ X23 )
| ~ ( in @ Z0 @ X24 ) ) ) ),
inference(variable_rename,[status(thm)],[c_0_6]) ).
thf(c_0_9,plain,
! [X34: $i,X1: $i,X3: $i] :
( ( epred1_2 @ X3 @ X1 @ X34 )
<=> ( ~ ( in @ X34 @ X1 )
| ~ ( in @ X34 @ X3 ) ) ),
introduced(definition) ).
thf(c_0_10,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_7]) ).
thf(c_0_11,plain,
! [X3: $i,X1: $i] :
( ( symdiff @ X1 @ X3 )
= ( dsetconstr @ ( binunion @ X1 @ X3 ) @ ( epred1_2 @ X3 @ X1 ) ) ),
inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_8]),c_0_9]) ).
thf(c_0_12,negated_conjecture,
! [X4: $i,X3: $i,X1: $i] :
( ( in @ X1 @ ( symdiff @ X3 @ X4 ) )
| ~ ( in @ X1 @ ( binunion @ X3 @ X4 ) )
| ~ ( epred1_2 @ X4 @ X3 @ X1 ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i,X4: $i,X3: $i] :
( ( in @ X1 @ ( binunion @ X3 @ X4 ) )
| ~ ( in @ X1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_14,negated_conjecture,
~ ( in @ esk3_0 @ ( symdiff @ esk1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i,X4: $i,X3: $i] :
( ( in @ X1 @ ( symdiff @ X3 @ X4 ) )
| ~ ( epred1_2 @ X4 @ X3 @ X1 )
| ~ ( in @ X1 @ X3 ) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_16,negated_conjecture,
in @ esk3_0 @ esk1_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_17,plain,
! [X35: $i,X36: $i,X37: $i] :
( ( ~ ( epred1_2 @ X37 @ X36 @ X35 )
| ~ ( in @ X35 @ X36 )
| ~ ( in @ X35 @ X37 ) )
& ( ( in @ X35 @ X36 )
| ( epred1_2 @ X37 @ X36 @ X35 ) )
& ( ( in @ X35 @ X37 )
| ( epred1_2 @ X37 @ X36 @ X35 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[])])])])]) ).
thf(c_0_18,negated_conjecture,
~ ( epred1_2 @ esk2_0 @ esk1_0 @ esk3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
thf(c_0_19,plain,
! [X4: $i,X3: $i,X1: $i] :
( ( in @ X1 @ X3 )
| ( epred1_2 @ X3 @ X4 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_20,negated_conjecture,
~ ( in @ esk3_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_21,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SEU612^2 : TPTP v8.2.0. Released v3.7.0.
% 0.00/0.09 % Command : run_E %s %d THM
% 0.08/0.29 % Computer : n019.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 300
% 0.08/0.29 % WCLimit : 300
% 0.08/0.29 % DateTime : Sun May 19 18:03:23 EDT 2024
% 0.08/0.29 % CPUTime :
% 0.14/0.41 Running higher-order theorem proving
% 0.14/0.41 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.14/0.43 # Version: 3.1.0-ho
% 0.14/0.43 # Preprocessing class: HSSSSLSSSLMNSFA.
% 0.14/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 # Starting new_ho_10 with 1500s (5) cores
% 0.14/0.43 # Starting full_lambda_3 with 300s (1) cores
% 0.14/0.43 # Starting ho_unfolding_6 with 300s (1) cores
% 0.14/0.43 # Starting sh4l with 300s (1) cores
% 0.14/0.43 # new_ho_10 with pid 16371 completed with status 0
% 0.14/0.43 # Result found by new_ho_10
% 0.14/0.43 # Preprocessing class: HSSSSLSSSLMNSFA.
% 0.14/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 # Starting new_ho_10 with 1500s (5) cores
% 0.14/0.43 # No SInE strategy applied
% 0.14/0.43 # Search class: HGHSF-FFSF22-SSFFMSBN
% 0.14/0.43 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.43 # Starting new_ho_10 with 901s (1) cores
% 0.14/0.43 # Starting new_bool_1 with 151s (1) cores
% 0.14/0.43 # Starting new_bool_2 with 151s (1) cores
% 0.14/0.43 # Starting new_bool_9 with 151s (1) cores
% 0.14/0.43 # Starting ehoh_best8_lambda with 146s (1) cores
% 0.14/0.43 # new_ho_10 with pid 16377 completed with status 0
% 0.14/0.43 # Result found by new_ho_10
% 0.14/0.43 # Preprocessing class: HSSSSLSSSLMNSFA.
% 0.14/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 # Starting new_ho_10 with 1500s (5) cores
% 0.14/0.43 # No SInE strategy applied
% 0.14/0.43 # Search class: HGHSF-FFSF22-SSFFMSBN
% 0.14/0.43 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.43 # Starting new_ho_10 with 901s (1) cores
% 0.14/0.43 # Preprocessing time : 0.001 s
% 0.14/0.43 # Presaturation interreduction done
% 0.14/0.43
% 0.14/0.43 # Proof found!
% 0.14/0.43 # SZS status Theorem
% 0.14/0.43 # SZS output start CNFRefutation
% See solution above
% 0.14/0.43 # Parsed axioms : 10
% 0.14/0.43 # Removed by relevancy pruning/SinE : 0
% 0.14/0.43 # Initial clauses : 15
% 0.14/0.43 # Removed in clause preprocessing : 6
% 0.14/0.43 # Initial clauses in saturation : 9
% 0.14/0.43 # Processed clauses : 21
% 0.14/0.43 # ...of these trivial : 0
% 0.14/0.43 # ...subsumed : 0
% 0.14/0.43 # ...remaining for further processing : 21
% 0.14/0.43 # Other redundant clauses eliminated : 0
% 0.14/0.43 # Clauses deleted for lack of memory : 0
% 0.14/0.43 # Backward-subsumed : 0
% 0.14/0.43 # Backward-rewritten : 0
% 0.14/0.43 # Generated clauses : 7
% 0.14/0.43 # ...of the previous two non-redundant : 3
% 0.14/0.43 # ...aggressively subsumed : 0
% 0.14/0.43 # Contextual simplify-reflections : 0
% 0.14/0.43 # Paramodulations : 7
% 0.14/0.43 # Factorizations : 0
% 0.14/0.43 # NegExts : 0
% 0.14/0.43 # Equation resolutions : 0
% 0.14/0.43 # Disequality decompositions : 0
% 0.14/0.43 # Total rewrite steps : 2
% 0.14/0.43 # ...of those cached : 1
% 0.14/0.43 # Propositional unsat checks : 0
% 0.14/0.43 # Propositional check models : 0
% 0.14/0.43 # Propositional check unsatisfiable : 0
% 0.14/0.43 # Propositional clauses : 0
% 0.14/0.43 # Propositional clauses after purity: 0
% 0.14/0.43 # Propositional unsat core size : 0
% 0.14/0.43 # Propositional preprocessing time : 0.000
% 0.14/0.43 # Propositional encoding time : 0.000
% 0.14/0.43 # Propositional solver time : 0.000
% 0.14/0.43 # Success case prop preproc time : 0.000
% 0.14/0.43 # Success case prop encoding time : 0.000
% 0.14/0.43 # Success case prop solver time : 0.000
% 0.14/0.43 # Current number of processed clauses : 12
% 0.14/0.43 # Positive orientable unit clauses : 2
% 0.14/0.43 # Positive unorientable unit clauses: 0
% 0.14/0.43 # Negative unit clauses : 3
% 0.14/0.43 # Non-unit-clauses : 7
% 0.14/0.43 # Current number of unprocessed clauses: 0
% 0.14/0.43 # ...number of literals in the above : 0
% 0.14/0.43 # Current number of archived formulas : 0
% 0.14/0.43 # Current number of archived clauses : 9
% 0.14/0.43 # Clause-clause subsumption calls (NU) : 16
% 0.14/0.43 # Rec. Clause-clause subsumption calls : 13
% 0.14/0.43 # Non-unit clause-clause subsumptions : 0
% 0.14/0.43 # Unit Clause-clause subsumption calls : 0
% 0.14/0.43 # Rewrite failures with RHS unbound : 0
% 0.14/0.43 # BW rewrite match attempts : 0
% 0.14/0.43 # BW rewrite match successes : 0
% 0.14/0.43 # Condensation attempts : 21
% 0.14/0.43 # Condensation successes : 0
% 0.14/0.43 # Termbank termtop insertions : 1132
% 0.14/0.43 # Search garbage collected termcells : 313
% 0.14/0.43
% 0.14/0.43 # -------------------------------------------------
% 0.14/0.43 # User time : 0.004 s
% 0.14/0.43 # System time : 0.001 s
% 0.14/0.43 # Total time : 0.005 s
% 0.14/0.43 # Maximum resident set size: 1844 pages
% 0.14/0.43
% 0.14/0.43 # -------------------------------------------------
% 0.14/0.43 # User time : 0.008 s
% 0.14/0.43 # System time : 0.006 s
% 0.14/0.43 # Total time : 0.014 s
% 0.14/0.43 # Maximum resident set size: 1704 pages
% 0.14/0.43 % E---3.1 exiting
% 0.14/0.43 % E exiting
%------------------------------------------------------------------------------