TSTP Solution File: SET950+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET950+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:24:27 EDT 2023
% Result : Timeout 0.28s 300.17s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 3 unt; 0 def)
% Number of atoms : 94 ( 30 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 126 ( 53 ~; 48 |; 21 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-4 aty)
% Number of variables : 69 ( 0 sgn; 38 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t103_zfmisc_1,conjecture,
! [X1,X2,X3,X4] :
~ ( subset(X1,cartesian_product2(X2,X3))
& in(X4,X1)
& ! [X5,X6] :
~ ( in(X5,X2)
& in(X6,X3)
& X4 = ordered_pair(X5,X6) ) ),
file('/export/starexec/sandbox2/tmp/tmp.grYSwSyq8j/E---3.1_11664.p',t103_zfmisc_1) ).
fof(d2_zfmisc_1,axiom,
! [X1,X2,X3] :
( X3 = cartesian_product2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ? [X5,X6] :
( in(X5,X1)
& in(X6,X2)
& X4 = ordered_pair(X5,X6) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.grYSwSyq8j/E---3.1_11664.p',d2_zfmisc_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.grYSwSyq8j/E---3.1_11664.p',d3_tarski) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3,X4] :
~ ( subset(X1,cartesian_product2(X2,X3))
& in(X4,X1)
& ! [X5,X6] :
~ ( in(X5,X2)
& in(X6,X3)
& X4 = ordered_pair(X5,X6) ) ),
inference(assume_negation,[status(cth)],[t103_zfmisc_1]) ).
fof(c_0_4,negated_conjecture,
! [X11,X12] :
( subset(esk1_0,cartesian_product2(esk2_0,esk3_0))
& in(esk4_0,esk1_0)
& ( ~ in(X11,esk2_0)
| ~ in(X12,esk3_0)
| esk4_0 != ordered_pair(X11,X12) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
fof(c_0_5,plain,
! [X24,X25,X26,X27,X30,X31,X32,X33,X34,X35,X37,X38] :
( ( in(esk6_4(X24,X25,X26,X27),X24)
| ~ in(X27,X26)
| X26 != cartesian_product2(X24,X25) )
& ( in(esk7_4(X24,X25,X26,X27),X25)
| ~ in(X27,X26)
| X26 != cartesian_product2(X24,X25) )
& ( X27 = ordered_pair(esk6_4(X24,X25,X26,X27),esk7_4(X24,X25,X26,X27))
| ~ in(X27,X26)
| X26 != cartesian_product2(X24,X25) )
& ( ~ in(X31,X24)
| ~ in(X32,X25)
| X30 != ordered_pair(X31,X32)
| in(X30,X26)
| X26 != cartesian_product2(X24,X25) )
& ( ~ in(esk8_3(X33,X34,X35),X35)
| ~ in(X37,X33)
| ~ in(X38,X34)
| esk8_3(X33,X34,X35) != ordered_pair(X37,X38)
| X35 = cartesian_product2(X33,X34) )
& ( in(esk9_3(X33,X34,X35),X33)
| in(esk8_3(X33,X34,X35),X35)
| X35 = cartesian_product2(X33,X34) )
& ( in(esk10_3(X33,X34,X35),X34)
| in(esk8_3(X33,X34,X35),X35)
| X35 = cartesian_product2(X33,X34) )
& ( esk8_3(X33,X34,X35) = ordered_pair(esk9_3(X33,X34,X35),esk10_3(X33,X34,X35))
| in(esk8_3(X33,X34,X35),X35)
| X35 = cartesian_product2(X33,X34) ) ),
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_zfmisc_1])])])])])]) ).
cnf(c_0_6,negated_conjecture,
( ~ in(X1,esk2_0)
| ~ in(X2,esk3_0)
| esk4_0 != ordered_pair(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( X1 = ordered_pair(esk6_4(X2,X3,X4,X1),esk7_4(X2,X3,X4,X1))
| ~ in(X1,X4)
| X4 != cartesian_product2(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( X1 != cartesian_product2(X2,X3)
| X4 != esk4_0
| ~ in(esk7_4(X2,X3,X1,X4),esk3_0)
| ~ in(esk6_4(X2,X3,X1,X4),esk2_0)
| ~ in(X4,X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
( in(esk7_4(X1,X2,X3,X4),X2)
| ~ in(X4,X3)
| X3 != cartesian_product2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
( X1 != cartesian_product2(X2,esk3_0)
| X3 != esk4_0
| ~ in(esk6_4(X2,esk3_0,X1,X3),esk2_0)
| ~ in(X3,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
( in(esk6_4(X1,X2,X3,X4),X1)
| ~ in(X4,X3)
| X3 != cartesian_product2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_12,plain,
! [X17,X18,X19,X20,X21] :
( ( ~ subset(X17,X18)
| ~ in(X19,X17)
| in(X19,X18) )
& ( in(esk5_2(X20,X21),X20)
| subset(X20,X21) )
& ( ~ in(esk5_2(X20,X21),X21)
| subset(X20,X21) ) ),
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_13,negated_conjecture,
( X1 != cartesian_product2(esk2_0,esk3_0)
| X2 != esk4_0
| ~ in(X2,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
subset(esk1_0,cartesian_product2(esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,negated_conjecture,
( X1 != esk4_0
| ~ in(X1,cartesian_product2(esk2_0,esk3_0)) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( in(X1,cartesian_product2(esk2_0,esk3_0))
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
( X1 != esk4_0
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,negated_conjecture,
in(esk4_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_18,c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET950+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Oct 2 16:58:21 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.17/0.43 Running first-order model finding
% 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 --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.grYSwSyq8j/E---3.1_11664.p
% 0.28/300.17 # Version: 3.1pre001
% 0.28/300.17 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.28/300.17 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/300.17 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.28/300.17 # Starting new_bool_3 with 300s (1) cores
% 0.28/300.17 # Starting new_bool_1 with 300s (1) cores
% 0.28/300.17 # Starting sh5l with 300s (1) cores
% 0.28/300.17 # new_bool_3 with pid 11743 completed with status 0
% 0.28/300.17 # Result found by new_bool_3
% 0.28/300.17 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.28/300.17 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/300.17 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.28/300.17 # Starting new_bool_3 with 300s (1) cores
% 0.28/300.17 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.28/300.17 # Search class: FGHSF-FFMS32-SFFFFFNN
% 0.28/300.17 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.28/300.17 # Starting G-E--_301_C18_F1_URBAN_S0Y with 181s (1) cores
% 0.28/300.17 # G-E--_301_C18_F1_URBAN_S0Y with pid 11747 completed with status 0
% 0.28/300.17 # Result found by G-E--_301_C18_F1_URBAN_S0Y
% 0.28/300.17 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.28/300.17 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/300.17 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.28/300.17 # Starting new_bool_3 with 300s (1) cores
% 0.28/300.17 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.28/300.17 # Search class: FGHSF-FFMS32-SFFFFFNN
% 0.28/300.17 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.28/300.17 # Starting G-E--_301_C18_F1_URBAN_S0Y with 181s (1) cores
% 0.28/300.17 # Preprocessing time : 0.001 s
% 0.28/300.17
% 0.28/300.17 # Proof found!
% 0.28/300.17 # SZS status Theorem
% 0.28/300.17 # SZS output start CNFRefutation
% See solution above
% 0.28/300.17 # Parsed axioms : 10
% 0.28/300.17 # Removed by relevancy pruning/SinE : 2
% 0.28/300.17 # Initial clauses : 19
% 0.28/300.17 # Removed in clause preprocessing : 0
% 0.28/300.17 # Initial clauses in saturation : 19
% 0.28/300.17 # Processed clauses : 55
% 0.28/300.17 # ...of these trivial : 1
% 0.28/300.17 # ...subsumed : 3
% 0.28/300.17 # ...remaining for further processing : 51
% 0.28/300.17 # Other redundant clauses eliminated : 1
% 0.28/300.17 # Clauses deleted for lack of memory : 0
% 0.28/300.17 # Backward-subsumed : 0
% 0.28/300.17 # Backward-rewritten : 0
% 0.28/300.17 # Generated clauses : 115
% 0.28/300.17 # ...of the previous two non-redundant : 110
% 0.28/300.17 # ...aggressively subsumed : 0
% 0.28/300.17 # Contextual simplify-reflections : 0
% 0.28/300.17 # Paramodulations : 110
% 0.28/300.17 # Factorizations : 0
% 0.28/300.17 # NegExts : 0
% 0.28/300.17 # Equation resolutions : 5
% 0.28/300.17 # Total rewrite steps : 2
% 0.28/300.17 # Propositional unsat checks : 0
% 0.28/300.17 # Propositional check models : 0
% 0.28/300.17 # Propositional check unsatisfiable : 0
% 0.28/300.17 # Propositional clauses : 0
% 0.28/300.17 # Propositional clauses after purity: 0
% 0.28/300.17 # Propositional unsat core size : 0
% 0.28/300.17 # Propositional preprocessing time : 0.000
% 0.28/300.17 # Propositional encoding time : 0.000
% 0.28/300.17 # Propositional solver time : 0.000
% 0.28/300.17 # Success case prop preproc time : 0.000
% 0.28/300.17 # Success case prop encoding time : 0.000
% 0.28/300.17 # Success case prop solver time : 0.000
% 0.28/300.17 # Current number of processed clauses : 51
% 0.28/300.17 # Positive orientable unit clauses : 4
% 0.28/300.17 # Positive unorientable unit clauses: 0
% 0.28/300.17 # Negative unit clauses : 5
% 0.28/300.17 # Non-unit-clauses : 42
% 0.28/300.17 # Current number of unprocessed clauses: 68
% 0.28/300.17 # ...number of literals in the above : 317
% 0.28/300.17 # Current number of archived formulas : 0
% 0.28/300.17 # Current number of archived clauses : 0
% 0.28/300.17 # Clause-clause subsumption calls (NU) : 504
% 0.28/300.17 # Rec. Clause-clause subsumption calls : 158
% 0.28/300.17 # Non-unit clause-clause subsumptions : 2
% 0.28/300.17 # Unit Clause-clause subsumption calls : 25
% 0.28/300.17 # Rewrite failures with RHS unbound : 0
% 0.28/300.17 # BW rewrite match attempts : 1
% 0.28/300.17 # BW rewrite match successes : 0
% 0.28/300.17 # Condensation attempts : 0
% 0.28/300.17 # Condensation successes : 0
% 0.28/300.17 # Termbank termtop insertions : 2958
% 0.28/300.17
% 0.28/300.17 # -------------------------------------------------
% 0.28/300.17 # User time : 0.005 s
% 0.28/300.17 # System time : 0.003 s
% 0.28/300.17 # Total time : 0.007 s
% 0.28/300.17 # Maximum resident set size: 1728 pages
% 0.28/300.17
% 0.28/300.17 # -------------------------------------------------
% 0.28/300.17 # User time : 0.005 s
% 0.28/300.17 # System time : 0.005 s
% 0.28/300.17 # Total time : 0.009 s
% 0.28/300.17 # Maximum resident set size: 1684 pages
% 0.28/300.17 % E---3.1 exiting
%------------------------------------------------------------------------------