TSTP Solution File: SET909+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET909+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:21:16 EDT 2023
% Result : Theorem 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 12 unt; 0 def)
% Number of atoms : 78 ( 40 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 91 ( 36 ~; 38 |; 11 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 60 ( 7 sgn; 41 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t50_zfmisc_1,conjecture,
! [X1,X2,X3] : set_union2(unordered_pair(X1,X2),X3) != empty_set,
file('/export/starexec/sandbox/tmp/tmp.baQWEBpITQ/E---3.1_29292.p',t50_zfmisc_1) ).
fof(d1_xboole_0,axiom,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.baQWEBpITQ/E---3.1_29292.p',d1_xboole_0) ).
fof(d2_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_union2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
| in(X4,X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.baQWEBpITQ/E---3.1_29292.p',d2_xboole_0) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.baQWEBpITQ/E---3.1_29292.p',commutativity_k2_xboole_0) ).
fof(d2_tarski,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X1
| X4 = X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.baQWEBpITQ/E---3.1_29292.p',d2_tarski) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X3] : set_union2(unordered_pair(X1,X2),X3) != empty_set,
inference(assume_negation,[status(cth)],[t50_zfmisc_1]) ).
fof(c_0_6,plain,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[d1_xboole_0]) ).
fof(c_0_7,plain,
! [X14,X15,X16,X17,X18,X19,X20,X21] :
( ( ~ in(X17,X16)
| in(X17,X14)
| in(X17,X15)
| X16 != set_union2(X14,X15) )
& ( ~ in(X18,X14)
| in(X18,X16)
| X16 != set_union2(X14,X15) )
& ( ~ in(X18,X15)
| in(X18,X16)
| X16 != set_union2(X14,X15) )
& ( ~ in(esk5_3(X19,X20,X21),X19)
| ~ in(esk5_3(X19,X20,X21),X21)
| X21 = set_union2(X19,X20) )
& ( ~ in(esk5_3(X19,X20,X21),X20)
| ~ in(esk5_3(X19,X20,X21),X21)
| X21 = set_union2(X19,X20) )
& ( in(esk5_3(X19,X20,X21),X21)
| in(esk5_3(X19,X20,X21),X19)
| in(esk5_3(X19,X20,X21),X20)
| X21 = set_union2(X19,X20) ) ),
inference(distribute,[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)],[d2_xboole_0])])])])])]) ).
fof(c_0_8,negated_conjecture,
set_union2(unordered_pair(esk1_0,esk2_0),esk3_0) = empty_set,
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_9,plain,
! [X12,X13] : set_union2(X12,X13) = set_union2(X13,X12),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
fof(c_0_10,plain,
! [X8,X9,X10] :
( ( X8 != empty_set
| ~ in(X9,X8) )
& ( in(esk4_1(X10),X10)
| X10 = empty_set ) ),
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_6])])])])]) ).
cnf(c_0_11,plain,
( in(X1,X3)
| ~ in(X1,X2)
| X3 != set_union2(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
set_union2(unordered_pair(esk1_0,esk2_0),esk3_0) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X30,X31,X32,X33,X34,X35,X36,X37] :
( ( ~ in(X33,X32)
| X33 = X30
| X33 = X31
| X32 != unordered_pair(X30,X31) )
& ( X34 != X30
| in(X34,X32)
| X32 != unordered_pair(X30,X31) )
& ( X34 != X31
| in(X34,X32)
| X32 != unordered_pair(X30,X31) )
& ( esk6_3(X35,X36,X37) != X35
| ~ in(esk6_3(X35,X36,X37),X37)
| X37 = unordered_pair(X35,X36) )
& ( esk6_3(X35,X36,X37) != X36
| ~ in(esk6_3(X35,X36,X37),X37)
| X37 = unordered_pair(X35,X36) )
& ( in(esk6_3(X35,X36,X37),X37)
| esk6_3(X35,X36,X37) = X35
| esk6_3(X35,X36,X37) = X36
| X37 = unordered_pair(X35,X36) ) ),
inference(distribute,[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)],[d2_tarski])])])])])]) ).
cnf(c_0_16,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
set_union2(esk3_0,unordered_pair(esk1_0,esk2_0)) = empty_set,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
~ in(X1,empty_set),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( in(X1,X3)
| X1 != X2
| X3 != unordered_pair(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
~ in(X1,unordered_pair(esk1_0,esk2_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_21,plain,
in(X1,unordered_pair(X2,X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_19])]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_20,c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET909+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n025.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 2400
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon Oct 2 17:28:51 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.baQWEBpITQ/E---3.1_29292.p
% 0.19/0.48 # Version: 3.1pre001
% 0.19/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48 # Starting sh5l with 300s (1) cores
% 0.19/0.48 # new_bool_1 with pid 29379 completed with status 0
% 0.19/0.48 # Result found by new_bool_1
% 0.19/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48 # Search class: FGHSS-FFMS32-SFFFFFNN
% 0.19/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 131s (1) cores
% 0.19/0.48 # SAT001_MinMin_p005000_rr_RG with pid 29384 completed with status 0
% 0.19/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48 # Search class: FGHSS-FFMS32-SFFFFFNN
% 0.19/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 131s (1) cores
% 0.19/0.48 # Preprocessing time : 0.001 s
% 0.19/0.48 # Presaturation interreduction done
% 0.19/0.48
% 0.19/0.48 # Proof found!
% 0.19/0.48 # SZS status Theorem
% 0.19/0.48 # SZS output start CNFRefutation
% See solution above
% 0.19/0.48 # Parsed axioms : 13
% 0.19/0.48 # Removed by relevancy pruning/SinE : 0
% 0.19/0.48 # Initial clauses : 24
% 0.19/0.48 # Removed in clause preprocessing : 0
% 0.19/0.48 # Initial clauses in saturation : 24
% 0.19/0.48 # Processed clauses : 63
% 0.19/0.48 # ...of these trivial : 2
% 0.19/0.48 # ...subsumed : 7
% 0.19/0.48 # ...remaining for further processing : 54
% 0.19/0.48 # Other redundant clauses eliminated : 9
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 0
% 0.19/0.48 # Backward-rewritten : 1
% 0.19/0.48 # Generated clauses : 41
% 0.19/0.48 # ...of the previous two non-redundant : 33
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 0
% 0.19/0.48 # Paramodulations : 34
% 0.19/0.48 # Factorizations : 0
% 0.19/0.48 # NegExts : 0
% 0.19/0.48 # Equation resolutions : 9
% 0.19/0.48 # Total rewrite steps : 9
% 0.19/0.48 # Propositional unsat checks : 0
% 0.19/0.48 # Propositional check models : 0
% 0.19/0.48 # Propositional check unsatisfiable : 0
% 0.19/0.48 # Propositional clauses : 0
% 0.19/0.48 # Propositional clauses after purity: 0
% 0.19/0.48 # Propositional unsat core size : 0
% 0.19/0.48 # Propositional preprocessing time : 0.000
% 0.19/0.48 # Propositional encoding time : 0.000
% 0.19/0.48 # Propositional solver time : 0.000
% 0.19/0.48 # Success case prop preproc time : 0.000
% 0.19/0.48 # Success case prop encoding time : 0.000
% 0.19/0.48 # Success case prop solver time : 0.000
% 0.19/0.48 # Current number of processed clauses : 22
% 0.19/0.48 # Positive orientable unit clauses : 8
% 0.19/0.48 # Positive unorientable unit clauses: 2
% 0.19/0.48 # Negative unit clauses : 5
% 0.19/0.48 # Non-unit-clauses : 7
% 0.19/0.48 # Current number of unprocessed clauses: 17
% 0.19/0.48 # ...number of literals in the above : 44
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 25
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 45
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 37
% 0.19/0.48 # Non-unit clause-clause subsumptions : 3
% 0.19/0.48 # Unit Clause-clause subsumption calls : 6
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 20
% 0.19/0.48 # BW rewrite match successes : 16
% 0.19/0.48 # Condensation attempts : 0
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 1506
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.007 s
% 0.19/0.48 # System time : 0.001 s
% 0.19/0.48 # Total time : 0.009 s
% 0.19/0.48 # Maximum resident set size: 1704 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.008 s
% 0.19/0.48 # System time : 0.004 s
% 0.19/0.48 # Total time : 0.012 s
% 0.19/0.48 # Maximum resident set size: 1680 pages
% 0.19/0.48 % E---3.1 exiting
% 0.19/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------