TSTP Solution File: SET906+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET906+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:15 EDT 2023
% Result : Theorem 0.17s 0.44s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 12 unt; 0 def)
% Number of atoms : 91 ( 33 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 99 ( 35 ~; 43 |; 13 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 70 ( 5 sgn; 46 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t47_zfmisc_1,conjecture,
! [X1,X2,X3] :
( subset(set_union2(unordered_pair(X1,X2),X3),X3)
=> in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.qQJWa1AgyV/E---3.1_24003.p',t47_zfmisc_1) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.qQJWa1AgyV/E---3.1_24003.p',commutativity_k2_xboole_0) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qQJWa1AgyV/E---3.1_24003.p',d3_tarski) ).
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/sandbox2/tmp/tmp.qQJWa1AgyV/E---3.1_24003.p',d2_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/sandbox2/tmp/tmp.qQJWa1AgyV/E---3.1_24003.p',d2_tarski) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.qQJWa1AgyV/E---3.1_24003.p',commutativity_k2_tarski) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X3] :
( subset(set_union2(unordered_pair(X1,X2),X3),X3)
=> in(X1,X3) ),
inference(assume_negation,[status(cth)],[t47_zfmisc_1]) ).
fof(c_0_7,negated_conjecture,
( subset(set_union2(unordered_pair(esk6_0,esk7_0),esk8_0),esk8_0)
& ~ in(esk6_0,esk8_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_8,plain,
! [X9,X10] : set_union2(X9,X10) = set_union2(X10,X9),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
fof(c_0_9,plain,
! [X29,X30,X31,X32,X33] :
( ( ~ subset(X29,X30)
| ~ in(X31,X29)
| in(X31,X30) )
& ( in(esk3_2(X32,X33),X32)
| subset(X32,X33) )
& ( ~ in(esk3_2(X32,X33),X33)
| subset(X32,X33) ) ),
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)],[d3_tarski])])])])])]) ).
cnf(c_0_10,negated_conjecture,
subset(set_union2(unordered_pair(esk6_0,esk7_0),esk8_0),esk8_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X20,X21,X22,X23,X24,X25,X26,X27] :
( ( ~ in(X23,X22)
| in(X23,X20)
| in(X23,X21)
| X22 != set_union2(X20,X21) )
& ( ~ in(X24,X20)
| in(X24,X22)
| X22 != set_union2(X20,X21) )
& ( ~ in(X24,X21)
| in(X24,X22)
| X22 != set_union2(X20,X21) )
& ( ~ in(esk2_3(X25,X26,X27),X25)
| ~ in(esk2_3(X25,X26,X27),X27)
| X27 = set_union2(X25,X26) )
& ( ~ in(esk2_3(X25,X26,X27),X26)
| ~ in(esk2_3(X25,X26,X27),X27)
| X27 = set_union2(X25,X26) )
& ( in(esk2_3(X25,X26,X27),X27)
| in(esk2_3(X25,X26,X27),X25)
| in(esk2_3(X25,X26,X27),X26)
| X27 = set_union2(X25,X26) ) ),
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_13,plain,
! [X11,X12,X13,X14,X15,X16,X17,X18] :
( ( ~ in(X14,X13)
| X14 = X11
| X14 = X12
| X13 != unordered_pair(X11,X12) )
& ( X15 != X11
| in(X15,X13)
| X13 != unordered_pair(X11,X12) )
& ( X15 != X12
| in(X15,X13)
| X13 != unordered_pair(X11,X12) )
& ( esk1_3(X16,X17,X18) != X16
| ~ in(esk1_3(X16,X17,X18),X18)
| X18 = unordered_pair(X16,X17) )
& ( esk1_3(X16,X17,X18) != X17
| ~ in(esk1_3(X16,X17,X18),X18)
| X18 = unordered_pair(X16,X17) )
& ( in(esk1_3(X16,X17,X18),X18)
| esk1_3(X16,X17,X18) = X16
| esk1_3(X16,X17,X18) = X17
| X18 = unordered_pair(X16,X17) ) ),
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_14,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
subset(set_union2(esk8_0,unordered_pair(esk6_0,esk7_0)),esk8_0),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( in(X1,X3)
| ~ in(X1,X2)
| X3 != set_union2(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( in(X1,X3)
| X1 != X2
| X3 != unordered_pair(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X7,X8] : unordered_pair(X7,X8) = unordered_pair(X8,X7),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
cnf(c_0_19,negated_conjecture,
( in(X1,esk8_0)
| ~ in(X1,set_union2(esk8_0,unordered_pair(esk6_0,esk7_0))) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
in(X1,unordered_pair(X2,X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_17])]) ).
cnf(c_0_22,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,negated_conjecture,
( in(X1,esk8_0)
| ~ in(X1,unordered_pair(esk6_0,esk7_0)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
in(X1,unordered_pair(X1,X2)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
~ in(esk6_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET906+1 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n016.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 2400
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Mon Oct 2 18:01:51 EDT 2023
% 0.12/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.qQJWa1AgyV/E---3.1_24003.p
% 0.17/0.44 # Version: 3.1pre001
% 0.17/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.44 # Starting sh5l with 300s (1) cores
% 0.17/0.44 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 24082 completed with status 0
% 0.17/0.44 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.44 # No SInE strategy applied
% 0.17/0.44 # Search class: FGHSM-FFMF32-SFFFFFNN
% 0.17/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.44 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 813s (1) cores
% 0.17/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.44 # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.44 # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A with 136s (1) cores
% 0.17/0.44 # Starting H----_011_C18_F1_PI_SE_SP_S2S with 136s (1) cores
% 0.17/0.44 # G-E--_300_C01_F1_SE_CS_SP_S0Y with pid 24086 completed with status 0
% 0.17/0.44 # Result found by G-E--_300_C01_F1_SE_CS_SP_S0Y
% 0.17/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.44 # No SInE strategy applied
% 0.17/0.44 # Search class: FGHSM-FFMF32-SFFFFFNN
% 0.17/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.44 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 813s (1) cores
% 0.17/0.44 # Preprocessing time : 0.001 s
% 0.17/0.44
% 0.17/0.44 # Proof found!
% 0.17/0.44 # SZS status Theorem
% 0.17/0.44 # SZS output start CNFRefutation
% See solution above
% 0.17/0.44 # Parsed axioms : 13
% 0.17/0.44 # Removed by relevancy pruning/SinE : 0
% 0.17/0.44 # Initial clauses : 26
% 0.17/0.44 # Removed in clause preprocessing : 0
% 0.17/0.44 # Initial clauses in saturation : 26
% 0.17/0.44 # Processed clauses : 59
% 0.17/0.44 # ...of these trivial : 1
% 0.17/0.44 # ...subsumed : 22
% 0.17/0.44 # ...remaining for further processing : 36
% 0.17/0.44 # Other redundant clauses eliminated : 8
% 0.17/0.44 # Clauses deleted for lack of memory : 0
% 0.17/0.44 # Backward-subsumed : 0
% 0.17/0.44 # Backward-rewritten : 0
% 0.17/0.44 # Generated clauses : 92
% 0.17/0.44 # ...of the previous two non-redundant : 70
% 0.17/0.44 # ...aggressively subsumed : 0
% 0.17/0.44 # Contextual simplify-reflections : 0
% 0.17/0.44 # Paramodulations : 84
% 0.17/0.44 # Factorizations : 2
% 0.17/0.44 # NegExts : 0
% 0.17/0.44 # Equation resolutions : 8
% 0.17/0.44 # Total rewrite steps : 12
% 0.17/0.44 # Propositional unsat checks : 0
% 0.17/0.44 # Propositional check models : 0
% 0.17/0.44 # Propositional check unsatisfiable : 0
% 0.17/0.44 # Propositional clauses : 0
% 0.17/0.44 # Propositional clauses after purity: 0
% 0.17/0.44 # Propositional unsat core size : 0
% 0.17/0.44 # Propositional preprocessing time : 0.000
% 0.17/0.44 # Propositional encoding time : 0.000
% 0.17/0.44 # Propositional solver time : 0.000
% 0.17/0.44 # Success case prop preproc time : 0.000
% 0.17/0.44 # Success case prop encoding time : 0.000
% 0.17/0.44 # Success case prop solver time : 0.000
% 0.17/0.44 # Current number of processed clauses : 32
% 0.17/0.44 # Positive orientable unit clauses : 6
% 0.17/0.44 # Positive unorientable unit clauses: 2
% 0.17/0.44 # Negative unit clauses : 4
% 0.17/0.44 # Non-unit-clauses : 20
% 0.17/0.44 # Current number of unprocessed clauses: 36
% 0.17/0.44 # ...number of literals in the above : 84
% 0.17/0.44 # Current number of archived formulas : 0
% 0.17/0.44 # Current number of archived clauses : 0
% 0.17/0.44 # Clause-clause subsumption calls (NU) : 73
% 0.17/0.44 # Rec. Clause-clause subsumption calls : 72
% 0.17/0.44 # Non-unit clause-clause subsumptions : 17
% 0.17/0.44 # Unit Clause-clause subsumption calls : 1
% 0.17/0.44 # Rewrite failures with RHS unbound : 0
% 0.17/0.44 # BW rewrite match attempts : 3
% 0.17/0.44 # BW rewrite match successes : 2
% 0.17/0.44 # Condensation attempts : 0
% 0.17/0.44 # Condensation successes : 0
% 0.17/0.44 # Termbank termtop insertions : 1985
% 0.17/0.44
% 0.17/0.44 # -------------------------------------------------
% 0.17/0.44 # User time : 0.006 s
% 0.17/0.44 # System time : 0.000 s
% 0.17/0.44 # Total time : 0.006 s
% 0.17/0.44 # Maximum resident set size: 1752 pages
% 0.17/0.44
% 0.17/0.44 # -------------------------------------------------
% 0.17/0.44 # User time : 0.016 s
% 0.17/0.44 # System time : 0.005 s
% 0.17/0.44 # Total time : 0.022 s
% 0.17/0.44 # Maximum resident set size: 1684 pages
% 0.17/0.44 % E---3.1 exiting
% 0.17/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------