TSTP Solution File: SET930+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET930+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:20 EDT 2023
% Result : Theorem 0.16s 0.46s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 10 unt; 0 def)
% Number of atoms : 84 ( 44 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 99 ( 44 ~; 29 |; 21 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn; 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t74_zfmisc_1,conjecture,
! [X1,X2,X3] :
~ ( set_difference(unordered_pair(X1,X2),X3) != empty_set
& set_difference(unordered_pair(X1,X2),X3) != singleton(X1)
& set_difference(unordered_pair(X1,X2),X3) != singleton(X2)
& set_difference(unordered_pair(X1,X2),X3) != unordered_pair(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.ru0vQKfc4s/E---3.1_26172.p',t74_zfmisc_1) ).
fof(t72_zfmisc_1,axiom,
! [X1,X2,X3] :
( set_difference(unordered_pair(X1,X2),X3) = unordered_pair(X1,X2)
<=> ( ~ in(X1,X3)
& ~ in(X2,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ru0vQKfc4s/E---3.1_26172.p',t72_zfmisc_1) ).
fof(l39_zfmisc_1,axiom,
! [X1,X2,X3] :
( set_difference(unordered_pair(X1,X2),X3) = singleton(X1)
<=> ( ~ in(X1,X3)
& ( in(X2,X3)
| X1 = X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ru0vQKfc4s/E---3.1_26172.p',l39_zfmisc_1) ).
fof(t73_zfmisc_1,axiom,
! [X1,X2,X3] :
( set_difference(unordered_pair(X1,X2),X3) = empty_set
<=> ( in(X1,X3)
& in(X2,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ru0vQKfc4s/E---3.1_26172.p',t73_zfmisc_1) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.ru0vQKfc4s/E---3.1_26172.p',commutativity_k2_tarski) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X3] :
~ ( set_difference(unordered_pair(X1,X2),X3) != empty_set
& set_difference(unordered_pair(X1,X2),X3) != singleton(X1)
& set_difference(unordered_pair(X1,X2),X3) != singleton(X2)
& set_difference(unordered_pair(X1,X2),X3) != unordered_pair(X1,X2) ),
inference(assume_negation,[status(cth)],[t74_zfmisc_1]) ).
fof(c_0_6,plain,
! [X1,X2,X3] :
( set_difference(unordered_pair(X1,X2),X3) = unordered_pair(X1,X2)
<=> ( ~ in(X1,X3)
& ~ in(X2,X3) ) ),
inference(fof_simplification,[status(thm)],[t72_zfmisc_1]) ).
fof(c_0_7,plain,
! [X1,X2,X3] :
( set_difference(unordered_pair(X1,X2),X3) = singleton(X1)
<=> ( ~ in(X1,X3)
& ( in(X2,X3)
| X1 = X2 ) ) ),
inference(fof_simplification,[status(thm)],[l39_zfmisc_1]) ).
fof(c_0_8,negated_conjecture,
( set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) != empty_set
& set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) != singleton(esk3_0)
& set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) != singleton(esk4_0)
& set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) != unordered_pair(esk3_0,esk4_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_9,plain,
! [X13,X14,X15] :
( ( ~ in(X13,X15)
| set_difference(unordered_pair(X13,X14),X15) != unordered_pair(X13,X14) )
& ( ~ in(X14,X15)
| set_difference(unordered_pair(X13,X14),X15) != unordered_pair(X13,X14) )
& ( in(X13,X15)
| in(X14,X15)
| set_difference(unordered_pair(X13,X14),X15) = unordered_pair(X13,X14) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_10,plain,
! [X8,X9,X10] :
( ( ~ in(X8,X10)
| set_difference(unordered_pair(X8,X9),X10) != singleton(X8) )
& ( in(X9,X10)
| X8 = X9
| set_difference(unordered_pair(X8,X9),X10) != singleton(X8) )
& ( ~ in(X9,X10)
| in(X8,X10)
| set_difference(unordered_pair(X8,X9),X10) = singleton(X8) )
& ( X8 != X9
| in(X8,X10)
| set_difference(unordered_pair(X8,X9),X10) = singleton(X8) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_11,negated_conjecture,
set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) != unordered_pair(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( in(X1,X2)
| in(X3,X2)
| set_difference(unordered_pair(X1,X3),X2) = unordered_pair(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( in(X3,X2)
| set_difference(unordered_pair(X3,X1),X2) = singleton(X3)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( in(esk3_0,esk5_0)
| in(esk4_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) != singleton(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
( set_difference(unordered_pair(X1,esk4_0),esk5_0) = singleton(X1)
| in(esk3_0,esk5_0)
| in(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_17,plain,
! [X16,X17,X18] :
( ( in(X16,X18)
| set_difference(unordered_pair(X16,X17),X18) != empty_set )
& ( in(X17,X18)
| set_difference(unordered_pair(X16,X17),X18) != empty_set )
& ( ~ in(X16,X18)
| ~ in(X17,X18)
| set_difference(unordered_pair(X16,X17),X18) = empty_set ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t73_zfmisc_1])])]) ).
cnf(c_0_18,negated_conjecture,
in(esk3_0,esk5_0),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_19,plain,
! [X6,X7] : unordered_pair(X6,X7) = unordered_pair(X7,X6),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
cnf(c_0_20,negated_conjecture,
set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) != empty_set,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_21,plain,
( set_difference(unordered_pair(X1,X3),X2) = empty_set
| ~ in(X1,X2)
| ~ in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( set_difference(unordered_pair(X1,esk3_0),esk5_0) = singleton(X1)
| in(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_23,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( ~ in(esk4_0,esk5_0)
| ~ in(esk3_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) != singleton(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_26,negated_conjecture,
( set_difference(unordered_pair(esk3_0,X1),esk5_0) = singleton(X1)
| in(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
~ in(esk4_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_18])]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET930+1 : TPTP v8.1.2. Released v3.2.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n029.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 16:49:51 EDT 2023
% 0.12/0.32 % CPUTime :
% 0.16/0.44 Running first-order theorem proving
% 0.16/0.44 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.ru0vQKfc4s/E---3.1_26172.p
% 0.16/0.46 # Version: 3.1pre001
% 0.16/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.46 # Starting sh5l with 300s (1) cores
% 0.16/0.46 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 26250 completed with status 0
% 0.16/0.46 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.46 # No SInE strategy applied
% 0.16/0.46 # Search class: FGHSF-FFSF21-SFFFFFNN
% 0.16/0.46 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.16/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.46 # Starting new_bool_3 with 136s (1) cores
% 0.16/0.46 # Starting new_bool_1 with 136s (1) cores
% 0.16/0.46 # Starting sh5l with 136s (1) cores
% 0.16/0.46 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 26257 completed with status 0
% 0.16/0.46 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.46 # No SInE strategy applied
% 0.16/0.46 # Search class: FGHSF-FFSF21-SFFFFFNN
% 0.16/0.46 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.16/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.46 # Preprocessing time : 0.001 s
% 0.16/0.46 # Presaturation interreduction done
% 0.16/0.46
% 0.16/0.46 # Proof found!
% 0.16/0.46 # SZS status Theorem
% 0.16/0.46 # SZS output start CNFRefutation
% See solution above
% 0.16/0.46 # Parsed axioms : 9
% 0.16/0.46 # Removed by relevancy pruning/SinE : 0
% 0.16/0.46 # Initial clauses : 19
% 0.16/0.46 # Removed in clause preprocessing : 0
% 0.16/0.46 # Initial clauses in saturation : 19
% 0.16/0.46 # Processed clauses : 84
% 0.16/0.46 # ...of these trivial : 0
% 0.16/0.46 # ...subsumed : 25
% 0.16/0.46 # ...remaining for further processing : 59
% 0.16/0.46 # Other redundant clauses eliminated : 1
% 0.16/0.46 # Clauses deleted for lack of memory : 0
% 0.16/0.46 # Backward-subsumed : 4
% 0.16/0.46 # Backward-rewritten : 4
% 0.16/0.46 # Generated clauses : 111
% 0.16/0.46 # ...of the previous two non-redundant : 77
% 0.16/0.46 # ...aggressively subsumed : 0
% 0.16/0.46 # Contextual simplify-reflections : 4
% 0.16/0.46 # Paramodulations : 109
% 0.16/0.46 # Factorizations : 0
% 0.16/0.46 # NegExts : 0
% 0.16/0.46 # Equation resolutions : 2
% 0.16/0.46 # Total rewrite steps : 17
% 0.16/0.46 # Propositional unsat checks : 0
% 0.16/0.46 # Propositional check models : 0
% 0.16/0.46 # Propositional check unsatisfiable : 0
% 0.16/0.46 # Propositional clauses : 0
% 0.16/0.46 # Propositional clauses after purity: 0
% 0.16/0.46 # Propositional unsat core size : 0
% 0.16/0.46 # Propositional preprocessing time : 0.000
% 0.16/0.46 # Propositional encoding time : 0.000
% 0.16/0.46 # Propositional solver time : 0.000
% 0.16/0.46 # Success case prop preproc time : 0.000
% 0.16/0.46 # Success case prop encoding time : 0.000
% 0.16/0.46 # Success case prop solver time : 0.000
% 0.16/0.46 # Current number of processed clauses : 31
% 0.16/0.46 # Positive orientable unit clauses : 3
% 0.16/0.46 # Positive unorientable unit clauses: 1
% 0.16/0.46 # Negative unit clauses : 8
% 0.16/0.46 # Non-unit-clauses : 19
% 0.16/0.46 # Current number of unprocessed clauses: 22
% 0.16/0.46 # ...number of literals in the above : 70
% 0.16/0.46 # Current number of archived formulas : 0
% 0.16/0.46 # Current number of archived clauses : 27
% 0.16/0.46 # Clause-clause subsumption calls (NU) : 117
% 0.16/0.46 # Rec. Clause-clause subsumption calls : 103
% 0.16/0.46 # Non-unit clause-clause subsumptions : 29
% 0.16/0.46 # Unit Clause-clause subsumption calls : 9
% 0.16/0.46 # Rewrite failures with RHS unbound : 0
% 0.16/0.46 # BW rewrite match attempts : 5
% 0.16/0.46 # BW rewrite match successes : 5
% 0.16/0.46 # Condensation attempts : 0
% 0.16/0.46 # Condensation successes : 0
% 0.16/0.46 # Termbank termtop insertions : 1844
% 0.16/0.46
% 0.16/0.46 # -------------------------------------------------
% 0.16/0.46 # User time : 0.006 s
% 0.16/0.46 # System time : 0.002 s
% 0.16/0.46 # Total time : 0.008 s
% 0.16/0.46 # Maximum resident set size: 1720 pages
% 0.16/0.46
% 0.16/0.46 # -------------------------------------------------
% 0.16/0.46 # User time : 0.025 s
% 0.16/0.46 # System time : 0.005 s
% 0.16/0.46 # Total time : 0.030 s
% 0.16/0.46 # Maximum resident set size: 1680 pages
% 0.16/0.46 % E---3.1 exiting
% 0.16/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------