TSTP Solution File: SET961+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET961+1 : TPTP v8.1.2. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:25 EDT 2023
% Result : Theorem 0.16s 0.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 38 ( 11 unt; 0 def)
% Number of atoms : 93 ( 32 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 94 ( 39 ~; 40 |; 8 &)
% ( 4 <=>; 3 =>; 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 : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 74 ( 13 sgn; 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l55_zfmisc_1,axiom,
! [X1,X2,X3,X4] :
( in(ordered_pair(X1,X2),cartesian_product2(X3,X4))
<=> ( in(X1,X3)
& in(X2,X4) ) ),
file('/export/starexec/sandbox2/tmp/tmp.L58fDJMj3G/E---3.1_1042.p',l55_zfmisc_1) ).
fof(d5_tarski,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
file('/export/starexec/sandbox2/tmp/tmp.L58fDJMj3G/E---3.1_1042.p',d5_tarski) ).
fof(t114_zfmisc_1,conjecture,
! [X1,X2] :
( cartesian_product2(X1,X2) = cartesian_product2(X2,X1)
=> ( X1 = empty_set
| X2 = empty_set
| X1 = X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.L58fDJMj3G/E---3.1_1042.p',t114_zfmisc_1) ).
fof(d1_xboole_0,axiom,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.L58fDJMj3G/E---3.1_1042.p',d1_xboole_0) ).
fof(t2_tarski,axiom,
! [X1,X2] :
( ! [X3] :
( in(X3,X1)
<=> in(X3,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/tmp/tmp.L58fDJMj3G/E---3.1_1042.p',t2_tarski) ).
fof(c_0_5,plain,
! [X17,X18,X19,X20] :
( ( in(X17,X19)
| ~ in(ordered_pair(X17,X18),cartesian_product2(X19,X20)) )
& ( in(X18,X20)
| ~ in(ordered_pair(X17,X18),cartesian_product2(X19,X20)) )
& ( ~ in(X17,X19)
| ~ in(X18,X20)
| in(ordered_pair(X17,X18),cartesian_product2(X19,X20)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l55_zfmisc_1])])]) ).
fof(c_0_6,plain,
! [X13,X14] : ordered_pair(X13,X14) = unordered_pair(unordered_pair(X13,X14),singleton(X13)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2] :
( cartesian_product2(X1,X2) = cartesian_product2(X2,X1)
=> ( X1 = empty_set
| X2 = empty_set
| X1 = X2 ) ),
inference(assume_negation,[status(cth)],[t114_zfmisc_1]) ).
cnf(c_0_8,plain,
( in(X1,X2)
| ~ in(ordered_pair(X3,X1),cartesian_product2(X4,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,negated_conjecture,
( cartesian_product2(esk4_0,esk5_0) = cartesian_product2(esk5_0,esk4_0)
& esk4_0 != empty_set
& esk5_0 != empty_set
& esk4_0 != esk5_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_11,plain,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[d1_xboole_0]) ).
cnf(c_0_12,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),cartesian_product2(X4,X2)) ),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
cartesian_product2(esk4_0,esk5_0) = cartesian_product2(esk5_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( in(ordered_pair(X1,X3),cartesian_product2(X2,X4))
| ~ in(X1,X2)
| ~ in(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_15,plain,
! [X9,X10,X11] :
( ( X9 != empty_set
| ~ in(X10,X9) )
& ( in(esk1_1(X11),X11)
| X11 = 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_11])])])])]) ).
cnf(c_0_16,negated_conjecture,
( in(X1,esk5_0)
| ~ in(unordered_pair(unordered_pair(X2,X1),singleton(X2)),cartesian_product2(esk5_0,esk4_0)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4))
| ~ in(X3,X4)
| ~ in(X1,X2) ),
inference(rw,[status(thm)],[c_0_14,c_0_9]) ).
fof(c_0_18,plain,
! [X25,X26] :
( ( ~ in(esk6_2(X25,X26),X25)
| ~ in(esk6_2(X25,X26),X26)
| X25 = X26 )
& ( in(esk6_2(X25,X26),X25)
| in(esk6_2(X25,X26),X26)
| X25 = X26 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_tarski])])])]) ).
cnf(c_0_19,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( in(X1,esk5_0)
| ~ in(X1,esk4_0)
| ~ in(X2,esk5_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( in(esk6_2(X1,X2),X1)
| in(esk6_2(X1,X2),X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
~ in(X1,empty_set),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
( in(X1,X2)
| ~ in(ordered_pair(X1,X3),cartesian_product2(X2,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_24,negated_conjecture,
( esk4_0 = X1
| in(esk6_2(esk4_0,X1),esk5_0)
| in(esk6_2(esk4_0,X1),X1)
| ~ in(X2,esk5_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( empty_set = X1
| in(esk6_2(empty_set,X1),X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
esk5_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_27,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4)) ),
inference(rw,[status(thm)],[c_0_23,c_0_9]) ).
cnf(c_0_28,negated_conjecture,
( esk4_0 = X1
| in(esk6_2(esk4_0,X1),esk5_0)
| in(esk6_2(esk4_0,X1),X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_29,negated_conjecture,
esk4_0 != esk5_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_30,negated_conjecture,
( in(X1,esk4_0)
| ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(esk5_0,esk4_0)) ),
inference(spm,[status(thm)],[c_0_27,c_0_13]) ).
cnf(c_0_31,plain,
( X1 = X2
| ~ in(esk6_2(X1,X2),X1)
| ~ in(esk6_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_32,negated_conjecture,
in(esk6_2(esk4_0,esk5_0),esk5_0),
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_28]),c_0_29]) ).
cnf(c_0_33,negated_conjecture,
( in(X1,esk4_0)
| ~ in(X2,esk4_0)
| ~ in(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_17]) ).
cnf(c_0_34,negated_conjecture,
esk4_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_35,negated_conjecture,
~ in(esk6_2(esk4_0,esk5_0),esk4_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_29]) ).
cnf(c_0_36,negated_conjecture,
( in(X1,esk4_0)
| ~ in(X1,esk5_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_25]),c_0_34]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET961+1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n005.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 17:28:31 EDT 2023
% 0.11/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.L58fDJMj3G/E---3.1_1042.p
% 0.16/0.45 # Version: 3.1pre001
% 0.16/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 # Starting sh5l with 300s (1) cores
% 0.16/0.45 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1133 completed with status 0
% 0.16/0.45 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 # No SInE strategy applied
% 0.16/0.45 # Search class: FGHSF-FFSS21-SFFFFFNN
% 0.16/0.45 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.45 # Starting new_bool_3 with 136s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 136s (1) cores
% 0.16/0.45 # Starting sh5l with 136s (1) cores
% 0.16/0.45 # SAT001_MinMin_p005000_rr_RG with pid 1137 completed with status 0
% 0.16/0.45 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 # No SInE strategy applied
% 0.16/0.45 # Search class: FGHSF-FFSS21-SFFFFFNN
% 0.16/0.45 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.16/0.45 # Preprocessing time : 0.001 s
% 0.16/0.45 # Presaturation interreduction done
% 0.16/0.45
% 0.16/0.45 # Proof found!
% 0.16/0.45 # SZS status Theorem
% 0.16/0.45 # SZS output start CNFRefutation
% See solution above
% 0.16/0.45 # Parsed axioms : 11
% 0.16/0.45 # Removed by relevancy pruning/SinE : 0
% 0.16/0.45 # Initial clauses : 18
% 0.16/0.45 # Removed in clause preprocessing : 1
% 0.16/0.45 # Initial clauses in saturation : 17
% 0.16/0.45 # Processed clauses : 109
% 0.16/0.45 # ...of these trivial : 0
% 0.16/0.45 # ...subsumed : 30
% 0.16/0.45 # ...remaining for further processing : 79
% 0.16/0.45 # Other redundant clauses eliminated : 1
% 0.16/0.45 # Clauses deleted for lack of memory : 0
% 0.16/0.45 # Backward-subsumed : 2
% 0.16/0.45 # Backward-rewritten : 3
% 0.16/0.45 # Generated clauses : 172
% 0.16/0.45 # ...of the previous two non-redundant : 161
% 0.16/0.45 # ...aggressively subsumed : 0
% 0.16/0.45 # Contextual simplify-reflections : 0
% 0.16/0.45 # Paramodulations : 167
% 0.16/0.45 # Factorizations : 4
% 0.16/0.45 # NegExts : 0
% 0.16/0.45 # Equation resolutions : 1
% 0.16/0.45 # Total rewrite steps : 4
% 0.16/0.45 # Propositional unsat checks : 0
% 0.16/0.45 # Propositional check models : 0
% 0.16/0.45 # Propositional check unsatisfiable : 0
% 0.16/0.45 # Propositional clauses : 0
% 0.16/0.45 # Propositional clauses after purity: 0
% 0.16/0.45 # Propositional unsat core size : 0
% 0.16/0.45 # Propositional preprocessing time : 0.000
% 0.16/0.45 # Propositional encoding time : 0.000
% 0.16/0.45 # Propositional solver time : 0.000
% 0.16/0.45 # Success case prop preproc time : 0.000
% 0.16/0.45 # Success case prop encoding time : 0.000
% 0.16/0.45 # Success case prop solver time : 0.000
% 0.16/0.45 # Current number of processed clauses : 56
% 0.16/0.45 # Positive orientable unit clauses : 7
% 0.16/0.45 # Positive unorientable unit clauses: 1
% 0.16/0.45 # Negative unit clauses : 15
% 0.16/0.45 # Non-unit-clauses : 33
% 0.16/0.45 # Current number of unprocessed clauses: 67
% 0.16/0.45 # ...number of literals in the above : 181
% 0.16/0.45 # Current number of archived formulas : 0
% 0.16/0.45 # Current number of archived clauses : 23
% 0.16/0.45 # Clause-clause subsumption calls (NU) : 315
% 0.16/0.45 # Rec. Clause-clause subsumption calls : 277
% 0.16/0.45 # Non-unit clause-clause subsumptions : 17
% 0.16/0.45 # Unit Clause-clause subsumption calls : 66
% 0.16/0.45 # Rewrite failures with RHS unbound : 0
% 0.16/0.45 # BW rewrite match attempts : 3
% 0.16/0.45 # BW rewrite match successes : 3
% 0.16/0.45 # Condensation attempts : 0
% 0.16/0.45 # Condensation successes : 0
% 0.16/0.45 # Termbank termtop insertions : 2880
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.005 s
% 0.16/0.45 # System time : 0.002 s
% 0.16/0.45 # Total time : 0.007 s
% 0.16/0.45 # Maximum resident set size: 1756 pages
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.025 s
% 0.16/0.45 # System time : 0.005 s
% 0.16/0.45 # Total time : 0.030 s
% 0.16/0.45 # Maximum resident set size: 1676 pages
% 0.16/0.45 % E---3.1 exiting
% 0.16/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------