TSTP Solution File: SET047^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET047^1 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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 02:52:44 EDT 2024
% Result : Theorem 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 15
% Syntax : Number of formulae : 41 ( 11 unt; 10 typ; 0 def)
% Number of atoms : 90 ( 6 equ; 0 cnn)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 321 ( 24 ~; 33 |; 4 &; 255 @)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 7 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 29 ( 29 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 46 ( 17 ^ 29 !; 0 ?; 46 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mworld: $tType ).
thf(decl_23,type,
mactual: mworld ).
thf(decl_24,type,
mlocal: ( mworld > $o ) > $o ).
thf(decl_29,type,
mequiv: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_32,type,
mforall_di: ( $i > mworld > $o ) > mworld > $o ).
thf(decl_34,type,
set_equal: $i > $i > mworld > $o ).
thf(decl_35,type,
element: $i > $i > mworld > $o ).
thf(decl_36,type,
esk1_0: $i ).
thf(decl_37,type,
esk2_0: $i ).
thf(decl_38,type,
esk3_2: $i > $i > $i ).
thf(mlocal_def,axiom,
( mlocal
= ( ^ [X1: mworld > $o] : ( X1 @ mactual ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mlocal_def) ).
thf(mequiv_def,axiom,
( mequiv
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
<=> ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mequiv_def) ).
thf(mforall_di_def,axiom,
( mforall_di
= ( ^ [X6: $i > mworld > $o,X3: mworld] :
! [X7: $i] : ( X6 @ X7 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mforall_di_def) ).
thf(pel43_1,axiom,
( mlocal
@ ( mforall_di
@ ^ [X7: $i] :
( mforall_di
@ ^ [X9: $i] :
( mequiv @ ( set_equal @ X7 @ X9 )
@ ( mforall_di
@ ^ [X10: $i] : ( mequiv @ ( element @ X10 @ X7 ) @ ( element @ X10 @ X9 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel43_1) ).
thf(pel43,conjecture,
( mlocal
@ ( mforall_di
@ ^ [X7: $i] :
( mforall_di
@ ^ [X9: $i] : ( mequiv @ ( set_equal @ X7 @ X9 ) @ ( set_equal @ X9 @ X7 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel43) ).
thf(c_0_5,plain,
( mlocal
= ( ^ [Z0: mworld > $o] : ( Z0 @ mactual ) ) ),
inference(fof_simplification,[status(thm)],[mlocal_def]) ).
thf(c_0_6,plain,
( mequiv
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
<=> ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mequiv_def]) ).
thf(c_0_7,plain,
( mforall_di
= ( ^ [Z0: $i > mworld > $o,Z1: mworld] :
! [X7: $i] : ( Z0 @ X7 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mforall_di_def]) ).
thf(c_0_8,plain,
! [X15: $i,X14: $i] :
( ( set_equal @ X15 @ X14 @ mactual )
<=> ! [X13: $i] :
( ( element @ X13 @ X15 @ mactual )
<=> ( element @ X13 @ X14 @ mactual ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[pel43_1]),c_0_5]),c_0_6]),c_0_7]) ).
thf(c_0_9,negated_conjecture,
~ ! [X12: $i,X11: $i] :
( ( set_equal @ X12 @ X11 @ mactual )
<=> ( set_equal @ X11 @ X12 @ mactual ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[pel43])]),c_0_5]),c_0_6]),c_0_7]) ).
thf(c_0_10,plain,
! [X18: $i,X19: $i,X20: $i,X21: $i,X22: $i,X23: $i] :
( ( ~ ( element @ X20 @ X18 @ mactual )
| ( element @ X20 @ X19 @ mactual )
| ~ ( set_equal @ X18 @ X19 @ mactual ) )
& ( ~ ( element @ X21 @ X19 @ mactual )
| ( element @ X21 @ X18 @ mactual )
| ~ ( set_equal @ X18 @ X19 @ mactual ) )
& ( ~ ( element @ ( esk3_2 @ X22 @ X23 ) @ X22 @ mactual )
| ~ ( element @ ( esk3_2 @ X22 @ X23 ) @ X23 @ mactual )
| ( set_equal @ X22 @ X23 @ mactual ) )
& ( ( element @ ( esk3_2 @ X22 @ X23 ) @ X22 @ mactual )
| ( element @ ( esk3_2 @ X22 @ X23 ) @ X23 @ mactual )
| ( set_equal @ X22 @ X23 @ mactual ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])])])]) ).
thf(c_0_11,negated_conjecture,
( ( ~ ( set_equal @ esk1_0 @ esk2_0 @ mactual )
| ~ ( set_equal @ esk2_0 @ esk1_0 @ mactual ) )
& ( ( set_equal @ esk1_0 @ esk2_0 @ mactual )
| ( set_equal @ esk2_0 @ esk1_0 @ mactual ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
thf(c_0_12,plain,
! [X7: $i,X9: $i,X10: $i] :
( ( element @ X7 @ X10 @ mactual )
| ~ ( element @ X7 @ X9 @ mactual )
| ~ ( set_equal @ X9 @ X10 @ mactual ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_13,negated_conjecture,
( ( set_equal @ esk1_0 @ esk2_0 @ mactual )
| ( set_equal @ esk2_0 @ esk1_0 @ mactual ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_14,plain,
! [X7: $i,X10: $i,X9: $i] :
( ( element @ X7 @ X10 @ mactual )
| ~ ( element @ X7 @ X9 @ mactual )
| ~ ( set_equal @ X10 @ X9 @ mactual ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_15,negated_conjecture,
! [X7: $i] :
( ( element @ X7 @ esk2_0 @ mactual )
| ~ ( element @ X7 @ esk1_0 @ mactual ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
thf(c_0_16,plain,
! [X7: $i,X9: $i] :
( ( element @ ( esk3_2 @ X7 @ X9 ) @ X7 @ mactual )
| ( element @ ( esk3_2 @ X7 @ X9 ) @ X9 @ mactual )
| ( set_equal @ X7 @ X9 @ mactual ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_17,plain,
! [X7: $i,X9: $i] :
( ( set_equal @ X7 @ X9 @ mactual )
| ~ ( element @ ( esk3_2 @ X7 @ X9 ) @ X7 @ mactual )
| ~ ( element @ ( esk3_2 @ X7 @ X9 ) @ X9 @ mactual ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_18,negated_conjecture,
! [X7: $i] :
( ( set_equal @ esk2_0 @ esk1_0 @ mactual )
| ( element @ X7 @ esk1_0 @ mactual )
| ~ ( element @ X7 @ esk2_0 @ mactual ) ),
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
thf(c_0_19,negated_conjecture,
! [X7: $i] :
( ( element @ ( esk3_2 @ X7 @ esk1_0 ) @ esk2_0 @ mactual )
| ( element @ ( esk3_2 @ X7 @ esk1_0 ) @ X7 @ mactual )
| ( set_equal @ X7 @ esk1_0 @ mactual ) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_20,negated_conjecture,
! [X7: $i] :
( ( set_equal @ esk2_0 @ esk1_0 @ mactual )
| ( set_equal @ X7 @ esk1_0 @ mactual )
| ~ ( element @ ( esk3_2 @ X7 @ esk1_0 ) @ esk2_0 @ mactual )
| ~ ( element @ ( esk3_2 @ X7 @ esk1_0 ) @ X7 @ mactual ) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_21,negated_conjecture,
( ( element @ ( esk3_2 @ esk2_0 @ esk1_0 ) @ esk2_0 @ mactual )
| ( set_equal @ esk2_0 @ esk1_0 @ mactual ) ),
inference(ef,[status(thm)],[c_0_19]) ).
thf(c_0_22,negated_conjecture,
! [X7: $i] :
( ( element @ ( esk3_2 @ esk1_0 @ X7 ) @ esk2_0 @ mactual )
| ( element @ ( esk3_2 @ esk1_0 @ X7 ) @ X7 @ mactual )
| ( set_equal @ esk1_0 @ X7 @ mactual ) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_23,negated_conjecture,
( ~ ( set_equal @ esk1_0 @ esk2_0 @ mactual )
| ~ ( set_equal @ esk2_0 @ esk1_0 @ mactual ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_24,negated_conjecture,
set_equal @ esk2_0 @ esk1_0 @ mactual,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_21]) ).
thf(c_0_25,negated_conjecture,
( ( element @ ( esk3_2 @ esk1_0 @ esk2_0 ) @ esk2_0 @ mactual )
| ( set_equal @ esk1_0 @ esk2_0 @ mactual ) ),
inference(ef,[status(thm)],[c_0_22]) ).
thf(c_0_26,negated_conjecture,
~ ( set_equal @ esk1_0 @ esk2_0 @ mactual ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
thf(c_0_27,negated_conjecture,
element @ ( esk3_2 @ esk1_0 @ esk2_0 ) @ esk2_0 @ mactual,
inference(sr,[status(thm)],[c_0_25,c_0_26]) ).
thf(c_0_28,negated_conjecture,
~ ( element @ ( esk3_2 @ esk1_0 @ esk2_0 ) @ esk1_0 @ mactual ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_27]),c_0_26]) ).
thf(c_0_29,negated_conjecture,
! [X7: $i] :
( ( element @ X7 @ esk1_0 @ mactual )
| ~ ( element @ X7 @ esk2_0 @ mactual ) ),
inference(spm,[status(thm)],[c_0_12,c_0_24]) ).
thf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET047^1 : TPTP v8.2.0. Released v8.1.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.36 % Computer : n017.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Mon May 20 12:47:53 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.21/0.49 Running higher-order theorem proving
% 0.21/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.21/0.50 # Version: 3.1.0-ho
% 0.21/0.50 # Preprocessing class: HSSSSMSSMLMNHSN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_2 with 300s (1) cores
% 0.21/0.50 # sh5l with pid 11621 completed with status 0
% 0.21/0.50 # Result found by sh5l
% 0.21/0.50 # Preprocessing class: HSSSSMSSMLMNHSN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.50 # Search class: HGHNF-FFSF22-SHSSMFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting new_ho_10 with 181s (1) cores
% 0.21/0.50 # new_ho_10 with pid 11626 completed with status 0
% 0.21/0.50 # Result found by new_ho_10
% 0.21/0.50 # Preprocessing class: HSSSSMSSMLMNHSN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.50 # Search class: HGHNF-FFSF22-SHSSMFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting new_ho_10 with 181s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Theorem
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 27
% 0.21/0.50 # Removed by relevancy pruning/SinE : 22
% 0.21/0.50 # Initial clauses : 6
% 0.21/0.50 # Removed in clause preprocessing : 0
% 0.21/0.50 # Initial clauses in saturation : 6
% 0.21/0.50 # Processed clauses : 33
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 5
% 0.21/0.50 # ...remaining for further processing : 28
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 1
% 0.21/0.50 # Backward-rewritten : 7
% 0.21/0.50 # Generated clauses : 36
% 0.21/0.50 # ...of the previous two non-redundant : 25
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 3
% 0.21/0.50 # Paramodulations : 29
% 0.21/0.50 # Factorizations : 6
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 12
% 0.21/0.50 # ...of those cached : 8
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 13
% 0.21/0.50 # Positive orientable unit clauses : 3
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 2
% 0.21/0.50 # Non-unit-clauses : 8
% 0.21/0.50 # Current number of unprocessed clauses: 1
% 0.21/0.50 # ...number of literals in the above : 2
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 15
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 41
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 26
% 0.21/0.50 # Non-unit clause-clause subsumptions : 8
% 0.21/0.50 # Unit Clause-clause subsumption calls : 10
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 9
% 0.21/0.50 # BW rewrite match successes : 3
% 0.21/0.50 # Condensation attempts : 33
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 1701
% 0.21/0.50 # Search garbage collected termcells : 415
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.006 s
% 0.21/0.50 # System time : 0.002 s
% 0.21/0.50 # Total time : 0.008 s
% 0.21/0.50 # Maximum resident set size: 1888 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.007 s
% 0.21/0.50 # System time : 0.004 s
% 0.21/0.50 # Total time : 0.011 s
% 0.21/0.50 # Maximum resident set size: 1744 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.51 % E exiting
%------------------------------------------------------------------------------