TSTP Solution File: SEU807^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU807^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:26 EDT 2024
% Result : Theorem 0.25s 0.51s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 17
% Syntax : Number of formulae : 37 ( 6 unt; 11 typ; 0 def)
% Number of atoms : 98 ( 23 equ; 0 cnn)
% Maximal formula atoms : 21 ( 3 avg)
% Number of connectives : 318 ( 36 ~; 31 |; 12 &; 210 @)
% ( 7 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 9 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 86 ( 0 ^ 80 !; 6 ?; 86 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
emptyset: $i ).
thf(decl_24,type,
setadjoin: $i > $i > $i ).
thf(decl_25,type,
foundationAx: $o ).
thf(decl_26,type,
setadjoinIL: $o ).
thf(decl_27,type,
setadjoinIR: $o ).
thf(decl_28,type,
in__Cong: $o ).
thf(decl_29,type,
upairset2E: $o ).
thf(decl_30,type,
esk1_1: $i > $i ).
thf(decl_31,type,
esk2_0: $i ).
thf(decl_32,type,
esk3_0: $i ).
thf(notinself2,conjecture,
( foundationAx
=> ( setadjoinIL
=> ( setadjoinIR
=> ( in__Cong
=> ( upairset2E
=> ! [X1: $i,X3: $i] :
( ( in @ X1 @ X3 )
=> ~ ( in @ X3 @ X1 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',notinself2) ).
thf(foundationAx,axiom,
( foundationAx
<=> ! [X1: $i] :
( ? [X2: $i] : ( in @ X2 @ X1 )
=> ? [X3: $i] :
( ( in @ X3 @ X1 )
& ~ ? [X2: $i] :
( ( in @ X2 @ X3 )
& ( in @ X2 @ X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',foundationAx) ).
thf(setadjoinIL,axiom,
( setadjoinIL
<=> ! [X2: $i,X4: $i] : ( in @ X2 @ ( setadjoin @ X2 @ X4 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setadjoinIL) ).
thf(setadjoinIR,axiom,
( setadjoinIR
<=> ! [X2: $i,X1: $i,X4: $i] :
( ( in @ X4 @ X1 )
=> ( in @ X4 @ ( setadjoin @ X2 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setadjoinIR) ).
thf(in__Cong,axiom,
( in__Cong
<=> ! [X1: $i,X3: $i] :
( ( X1 = X3 )
=> ! [X2: $i,X4: $i] :
( ( X2 = X4 )
=> ( ( in @ X2 @ X1 )
<=> ( in @ X4 @ X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',in__Cong) ).
thf(upairset2E,axiom,
( upairset2E
<=> ! [X2: $i,X4: $i,X5: $i] :
( ( in @ X5 @ ( setadjoin @ X2 @ ( setadjoin @ X4 @ emptyset ) ) )
=> ( ( X5 = X2 )
| ( X5 = X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',upairset2E) ).
thf(c_0_6,negated_conjecture,
~ ( ! [X24: $i] :
( ? [X25: $i] : ( in @ X25 @ X24 )
=> ? [X26: $i] :
( ( in @ X26 @ X24 )
& ~ ? [X27: $i] :
( ( in @ X27 @ X26 )
& ( in @ X27 @ X24 ) ) ) )
=> ( ! [X28: $i,X29: $i] : ( in @ X28 @ ( setadjoin @ X28 @ X29 ) )
=> ( ! [X30: $i,X31: $i,X32: $i] :
( ( in @ X32 @ X31 )
=> ( in @ X32 @ ( setadjoin @ X30 @ X31 ) ) )
=> ( ! [X33: $i,X34: $i] :
( ( X33 = X34 )
=> ! [X35: $i,X36: $i] :
( ( X35 = X36 )
=> ( ( in @ X35 @ X33 )
<=> ( in @ X36 @ X34 ) ) ) )
=> ( ! [X37: $i,X38: $i,X39: $i] :
( ( in @ X39 @ ( setadjoin @ X37 @ ( setadjoin @ X38 @ emptyset ) ) )
=> ( ( X39 = X37 )
| ( X39 = X38 ) ) )
=> ! [X1: $i,X3: $i] :
( ( in @ X1 @ X3 )
=> ~ ( in @ X3 @ X1 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[notinself2]),foundationAx]),setadjoinIL]),setadjoinIR]),in__Cong]),upairset2E])]) ).
thf(c_0_7,negated_conjecture,
! [X40: $i,X41: $i,X43: $i,X44: $i,X45: $i,X46: $i,X47: $i,X48: $i,X49: $i,X50: $i,X51: $i,X52: $i,X53: $i,X54: $i,X55: $i] :
( ( ( in @ ( esk1_1 @ X40 ) @ X40 )
| ~ ( in @ X41 @ X40 ) )
& ( ~ ( in @ X43 @ ( esk1_1 @ X40 ) )
| ~ ( in @ X43 @ X40 )
| ~ ( in @ X41 @ X40 ) )
& ( in @ X44 @ ( setadjoin @ X44 @ X45 ) )
& ( ~ ( in @ X48 @ X47 )
| ( in @ X48 @ ( setadjoin @ X46 @ X47 ) ) )
& ( ~ ( in @ X51 @ X49 )
| ( in @ X52 @ X50 )
| ( X51 != X52 )
| ( X49 != X50 ) )
& ( ~ ( in @ X52 @ X50 )
| ( in @ X51 @ X49 )
| ( X51 != X52 )
| ( X49 != X50 ) )
& ( ~ ( in @ X55 @ ( setadjoin @ X53 @ ( setadjoin @ X54 @ emptyset ) ) )
| ( X55 = X53 )
| ( X55 = X54 ) )
& ( in @ esk2_0 @ esk3_0 )
& ( in @ esk3_0 @ esk2_0 ) ),
inference(distribute,[status(thm)],[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_8,negated_conjecture,
! [X2: $i,X1: $i] :
( ( in @ ( esk1_1 @ X1 ) @ X1 )
| ~ ( in @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i,X2: $i] : ( in @ X1 @ ( setadjoin @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ~ ( in @ X1 @ ( esk1_1 @ X2 ) )
| ~ ( in @ X1 @ X2 )
| ~ ( in @ X3 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( X1 = X2 )
| ( X1 = X3 )
| ~ ( in @ X1 @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i,X2: $i] : ( in @ ( esk1_1 @ ( setadjoin @ X1 @ X2 ) ) @ ( setadjoin @ X1 @ X2 ) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i,X2: $i] :
( ~ ( in @ X1 @ ( esk1_1 @ X2 ) )
| ~ ( in @ X1 @ X2 ) ),
inference(condense,[status(thm)],[c_0_10]) ).
thf(c_0_14,negated_conjecture,
! [X2: $i,X1: $i] :
( ( ( esk1_1 @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) )
= X2 )
| ( ( esk1_1 @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) )
= X1 ) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( in @ X1 @ ( setadjoin @ X3 @ X2 ) )
| ~ ( in @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_16,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( ( esk1_1 @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) )
= X2 )
| ~ ( in @ X3 @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) )
| ~ ( in @ X3 @ X1 ) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ ( in @ X1 @ ( setadjoin @ X2 @ emptyset ) ) ),
inference(condense,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_15])]) ).
thf(c_0_18,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( ( esk1_1 @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) )
= X2 )
| ~ ( in @ X3 @ ( setadjoin @ X2 @ emptyset ) )
| ~ ( in @ X3 @ X1 ) ),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
thf(c_0_19,negated_conjecture,
! [X1: $i] :
( ( esk1_1 @ ( setadjoin @ X1 @ emptyset ) )
= X1 ),
inference(spm,[status(thm)],[c_0_17,c_0_12]) ).
thf(c_0_20,negated_conjecture,
! [X2: $i,X1: $i] :
( ( ( esk1_1 @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) )
= X2 )
| ~ ( in @ X2 @ X1 ) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_12]),c_0_19]) ).
thf(c_0_21,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ~ ( in @ X1 @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) )
| ~ ( in @ X1 @ X3 )
| ~ ( in @ X3 @ X2 ) ),
inference(spm,[status(thm)],[c_0_13,c_0_20]) ).
thf(c_0_22,negated_conjecture,
! [X2: $i,X1: $i] :
( ~ ( in @ X1 @ X2 )
| ~ ( in @ X2 @ X1 ) ),
inference(spm,[status(thm)],[c_0_21,c_0_9]) ).
thf(c_0_23,negated_conjecture,
in @ esk3_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_24,negated_conjecture,
in @ esk2_0 @ esk3_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SEU807^2 : TPTP v8.2.0. Released v3.7.0.
% 0.07/0.16 % Command : run_E %s %d THM
% 0.17/0.39 % Computer : n004.cluster.edu
% 0.17/0.39 % Model : x86_64 x86_64
% 0.17/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.39 % Memory : 8042.1875MB
% 0.17/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.39 % CPULimit : 300
% 0.17/0.39 % WCLimit : 300
% 0.17/0.39 % DateTime : Sun May 19 17:55:08 EDT 2024
% 0.17/0.39 % CPUTime :
% 0.25/0.49 Running higher-order theorem proving
% 0.25/0.49 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.25/0.51 # Version: 3.1.0-ho
% 0.25/0.51 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.25/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.51 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.25/0.51 # Starting post_as_ho8 with 300s (1) cores
% 0.25/0.51 # Starting post_as_ho3 with 300s (1) cores
% 0.25/0.51 # Starting post_as_ho2 with 300s (1) cores
% 0.25/0.51 # lpo6_lambda_fix with pid 29064 completed with status 0
% 0.25/0.51 # Result found by lpo6_lambda_fix
% 0.25/0.51 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.25/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.51 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.25/0.51 # No SInE strategy applied
% 0.25/0.51 # Search class: HGHSF-FFSF21-SFFFMFNN
% 0.25/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.51 # Starting new_ho_10 with 811s (1) cores
% 0.25/0.51 # Starting lpo6_lambda_fix with 151s (1) cores
% 0.25/0.51 # Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.25/0.51 # Starting lpo1_def_fix with 136s (1) cores
% 0.25/0.51 # Starting ehoh_best8_lambda with 136s (1) cores
% 0.25/0.51 # lpo6_lambda_fix with pid 29070 completed with status 0
% 0.25/0.51 # Result found by lpo6_lambda_fix
% 0.25/0.51 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.25/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.51 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.25/0.51 # No SInE strategy applied
% 0.25/0.51 # Search class: HGHSF-FFSF21-SFFFMFNN
% 0.25/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.51 # Starting new_ho_10 with 811s (1) cores
% 0.25/0.51 # Starting lpo6_lambda_fix with 151s (1) cores
% 0.25/0.51 # Preprocessing time : 0.001 s
% 0.25/0.51
% 0.25/0.51 # Proof found!
% 0.25/0.51 # SZS status Theorem
% 0.25/0.51 # SZS output start CNFRefutation
% See solution above
% 0.25/0.51 # Parsed axioms : 14
% 0.25/0.51 # Removed by relevancy pruning/SinE : 0
% 0.25/0.51 # Initial clauses : 17
% 0.25/0.51 # Removed in clause preprocessing : 10
% 0.25/0.51 # Initial clauses in saturation : 7
% 0.25/0.51 # Processed clauses : 40
% 0.25/0.51 # ...of these trivial : 2
% 0.25/0.51 # ...subsumed : 6
% 0.25/0.51 # ...remaining for further processing : 32
% 0.25/0.51 # Other redundant clauses eliminated : 2
% 0.25/0.51 # Clauses deleted for lack of memory : 0
% 0.25/0.51 # Backward-subsumed : 1
% 0.25/0.51 # Backward-rewritten : 0
% 0.25/0.51 # Generated clauses : 64
% 0.25/0.51 # ...of the previous two non-redundant : 46
% 0.25/0.51 # ...aggressively subsumed : 0
% 0.25/0.51 # Contextual simplify-reflections : 0
% 0.25/0.51 # Paramodulations : 60
% 0.25/0.51 # Factorizations : 2
% 0.25/0.51 # NegExts : 0
% 0.25/0.51 # Equation resolutions : 2
% 0.25/0.51 # Disequality decompositions : 0
% 0.25/0.51 # Total rewrite steps : 14
% 0.25/0.51 # ...of those cached : 3
% 0.25/0.51 # Propositional unsat checks : 0
% 0.25/0.51 # Propositional check models : 0
% 0.25/0.51 # Propositional check unsatisfiable : 0
% 0.25/0.51 # Propositional clauses : 0
% 0.25/0.51 # Propositional clauses after purity: 0
% 0.25/0.51 # Propositional unsat core size : 0
% 0.25/0.51 # Propositional preprocessing time : 0.000
% 0.25/0.51 # Propositional encoding time : 0.000
% 0.25/0.51 # Propositional solver time : 0.000
% 0.25/0.51 # Success case prop preproc time : 0.000
% 0.25/0.51 # Success case prop encoding time : 0.000
% 0.25/0.51 # Success case prop solver time : 0.000
% 0.25/0.51 # Current number of processed clauses : 31
% 0.25/0.51 # Positive orientable unit clauses : 8
% 0.25/0.51 # Positive unorientable unit clauses: 0
% 0.25/0.51 # Negative unit clauses : 7
% 0.25/0.51 # Non-unit-clauses : 16
% 0.25/0.51 # Current number of unprocessed clauses: 13
% 0.25/0.51 # ...number of literals in the above : 30
% 0.25/0.51 # Current number of archived formulas : 0
% 0.25/0.51 # Current number of archived clauses : 1
% 0.25/0.51 # Clause-clause subsumption calls (NU) : 79
% 0.25/0.51 # Rec. Clause-clause subsumption calls : 68
% 0.25/0.51 # Non-unit clause-clause subsumptions : 3
% 0.25/0.51 # Unit Clause-clause subsumption calls : 19
% 0.25/0.51 # Rewrite failures with RHS unbound : 0
% 0.25/0.51 # BW rewrite match attempts : 1
% 0.25/0.51 # BW rewrite match successes : 0
% 0.25/0.51 # Condensation attempts : 40
% 0.25/0.51 # Condensation successes : 3
% 0.25/0.51 # Termbank termtop insertions : 2054
% 0.25/0.51 # Search garbage collected termcells : 463
% 0.25/0.51
% 0.25/0.51 # -------------------------------------------------
% 0.25/0.51 # User time : 0.006 s
% 0.25/0.51 # System time : 0.002 s
% 0.25/0.51 # Total time : 0.008 s
% 0.25/0.51 # Maximum resident set size: 1836 pages
% 0.25/0.51
% 0.25/0.51 # -------------------------------------------------
% 0.25/0.51 # User time : 0.019 s
% 0.25/0.51 # System time : 0.007 s
% 0.25/0.51 # Total time : 0.026 s
% 0.25/0.51 # Maximum resident set size: 1712 pages
% 0.25/0.51 % E---3.1 exiting
% 0.25/0.51 % E exiting
%------------------------------------------------------------------------------