TSTP Solution File: SET950+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---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 : n015.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:23 EDT 2023
% Result : Timeout 573.24s 300.13s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 4 unt; 0 def)
% Number of atoms : 90 ( 23 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 114 ( 46 ~; 43 |; 21 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 6 avg)
% Maximal term depth : 4 ( 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 : 70 ( 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.fprnRHuLWy/E---3.1_29900.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.fprnRHuLWy/E---3.1_29900.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.fprnRHuLWy/E---3.1_29900.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,plain,
! [X13,X14,X15,X16,X19,X20,X21,X22,X23,X24,X26,X27] :
( ( in(esk5_4(X13,X14,X15,X16),X13)
| ~ in(X16,X15)
| X15 != cartesian_product2(X13,X14) )
& ( in(esk6_4(X13,X14,X15,X16),X14)
| ~ in(X16,X15)
| X15 != cartesian_product2(X13,X14) )
& ( X16 = ordered_pair(esk5_4(X13,X14,X15,X16),esk6_4(X13,X14,X15,X16))
| ~ in(X16,X15)
| X15 != cartesian_product2(X13,X14) )
& ( ~ in(X20,X13)
| ~ in(X21,X14)
| X19 != ordered_pair(X20,X21)
| in(X19,X15)
| X15 != cartesian_product2(X13,X14) )
& ( ~ in(esk7_3(X22,X23,X24),X24)
| ~ in(X26,X22)
| ~ in(X27,X23)
| esk7_3(X22,X23,X24) != ordered_pair(X26,X27)
| X24 = cartesian_product2(X22,X23) )
& ( in(esk8_3(X22,X23,X24),X22)
| in(esk7_3(X22,X23,X24),X24)
| X24 = cartesian_product2(X22,X23) )
& ( in(esk9_3(X22,X23,X24),X23)
| in(esk7_3(X22,X23,X24),X24)
| X24 = cartesian_product2(X22,X23) )
& ( esk7_3(X22,X23,X24) = ordered_pair(esk8_3(X22,X23,X24),esk9_3(X22,X23,X24))
| in(esk7_3(X22,X23,X24),X24)
| X24 = cartesian_product2(X22,X23) ) ),
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])])])])])]) ).
fof(c_0_5,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])])])]) ).
cnf(c_0_6,plain,
( X1 = ordered_pair(esk5_4(X2,X3,X4,X1),esk6_4(X2,X3,X4,X1))
| ~ in(X1,X4)
| X4 != cartesian_product2(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( ~ in(X1,esk2_0)
| ~ in(X2,esk3_0)
| esk4_0 != ordered_pair(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( ordered_pair(esk5_4(X1,X2,cartesian_product2(X1,X2),X3),esk6_4(X1,X2,cartesian_product2(X1,X2),X3)) = X3
| ~ in(X3,cartesian_product2(X1,X2)) ),
inference(er,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( in(esk6_4(X1,X2,X3,X4),X2)
| ~ in(X4,X3)
| X3 != cartesian_product2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
( ~ in(esk6_4(X1,X2,cartesian_product2(X1,X2),esk4_0),esk3_0)
| ~ in(esk5_4(X1,X2,cartesian_product2(X1,X2),esk4_0),esk2_0)
| ~ in(esk4_0,cartesian_product2(X1,X2)) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8])]) ).
cnf(c_0_11,plain,
( in(esk6_4(X1,X2,cartesian_product2(X1,X2),X3),X2)
| ~ in(X3,cartesian_product2(X1,X2)) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( in(esk5_4(X1,X2,X3,X4),X1)
| ~ in(X4,X3)
| X3 != cartesian_product2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_13,plain,
! [X36,X37,X38,X39,X40] :
( ( ~ subset(X36,X37)
| ~ in(X38,X36)
| in(X38,X37) )
& ( in(esk10_2(X39,X40),X39)
| subset(X39,X40) )
& ( ~ in(esk10_2(X39,X40),X40)
| subset(X39,X40) ) ),
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_14,negated_conjecture,
( ~ in(esk5_4(X1,esk3_0,cartesian_product2(X1,esk3_0),esk4_0),esk2_0)
| ~ in(esk4_0,cartesian_product2(X1,esk3_0)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( in(esk5_4(X1,X2,cartesian_product2(X1,X2),X3),X1)
| ~ in(X3,cartesian_product2(X1,X2)) ),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
subset(esk1_0,cartesian_product2(esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
~ in(esk4_0,cartesian_product2(esk2_0,esk3_0)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
( in(X1,cartesian_product2(esk2_0,esk3_0))
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
in(esk4_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SET950+1 : TPTP v8.1.2. Released v3.2.0.
% 0.06/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n015.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:02:31 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/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.fprnRHuLWy/E---3.1_29900.p
% 573.24/300.13 # Version: 3.1pre001
% 573.24/300.13 # Preprocessing class: FSMSSMSSSSSNFFN.
% 573.24/300.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 573.24/300.13 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 573.24/300.13 # Starting new_bool_3 with 300s (1) cores
% 573.24/300.13 # Starting new_bool_1 with 300s (1) cores
% 573.24/300.13 # Starting sh5l with 300s (1) cores
% 573.24/300.13 # sh5l with pid 29981 completed with status 0
% 573.24/300.13 # Result found by sh5l
% 573.24/300.13 # Preprocessing class: FSMSSMSSSSSNFFN.
% 573.24/300.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 573.24/300.13 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 573.24/300.13 # Starting new_bool_3 with 300s (1) cores
% 573.24/300.13 # Starting new_bool_1 with 300s (1) cores
% 573.24/300.13 # Starting sh5l with 300s (1) cores
% 573.24/300.13 # SinE strategy is gf500_gu_R04_F100_L20000
% 573.24/300.13 # Search class: FGHSS-FFMS32-SFFFFFNN
% 573.24/300.13 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 573.24/300.13 # Starting SAT001_MinMin_p005000_rr_RG with 131s (1) cores
% 573.24/300.13 # SAT001_MinMin_p005000_rr_RG with pid 29988 completed with status 0
% 573.24/300.13 # Result found by SAT001_MinMin_p005000_rr_RG
% 573.24/300.13 # Preprocessing class: FSMSSMSSSSSNFFN.
% 573.24/300.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 573.24/300.13 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 573.24/300.13 # Starting new_bool_3 with 300s (1) cores
% 573.24/300.13 # Starting new_bool_1 with 300s (1) cores
% 573.24/300.13 # Starting sh5l with 300s (1) cores
% 573.24/300.13 # SinE strategy is gf500_gu_R04_F100_L20000
% 573.24/300.13 # Search class: FGHSS-FFMS32-SFFFFFNN
% 573.24/300.13 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 573.24/300.13 # Starting SAT001_MinMin_p005000_rr_RG with 131s (1) cores
% 573.24/300.13 # Preprocessing time : 0.001 s
% 573.24/300.13 # Presaturation interreduction done
% 573.24/300.13
% 573.24/300.13 # Proof found!
% 573.24/300.13 # SZS status Theorem
% 573.24/300.13 # SZS output start CNFRefutation
% See solution above
% 573.24/300.13 # Parsed axioms : 10
% 573.24/300.13 # Removed by relevancy pruning/SinE : 0
% 573.24/300.13 # Initial clauses : 21
% 573.24/300.13 # Removed in clause preprocessing : 0
% 573.24/300.13 # Initial clauses in saturation : 21
% 573.24/300.13 # Processed clauses : 79
% 573.24/300.13 # ...of these trivial : 5
% 573.24/300.13 # ...subsumed : 1
% 573.24/300.13 # ...remaining for further processing : 73
% 573.24/300.13 # Other redundant clauses eliminated : 6
% 573.24/300.13 # Clauses deleted for lack of memory : 0
% 573.24/300.13 # Backward-subsumed : 0
% 573.24/300.13 # Backward-rewritten : 0
% 573.24/300.13 # Generated clauses : 85
% 573.24/300.13 # ...of the previous two non-redundant : 71
% 573.24/300.13 # ...aggressively subsumed : 0
% 573.24/300.13 # Contextual simplify-reflections : 0
% 573.24/300.13 # Paramodulations : 80
% 573.24/300.13 # Factorizations : 0
% 573.24/300.13 # NegExts : 0
% 573.24/300.13 # Equation resolutions : 6
% 573.24/300.13 # Total rewrite steps : 18
% 573.24/300.13 # Propositional unsat checks : 0
% 573.24/300.13 # Propositional check models : 0
% 573.24/300.13 # Propositional check unsatisfiable : 0
% 573.24/300.13 # Propositional clauses : 0
% 573.24/300.13 # Propositional clauses after purity: 0
% 573.24/300.13 # Propositional unsat core size : 0
% 573.24/300.13 # Propositional preprocessing time : 0.000
% 573.24/300.13 # Propositional encoding time : 0.000
% 573.24/300.13 # Propositional solver time : 0.000
% 573.24/300.13 # Success case prop preproc time : 0.000
% 573.24/300.13 # Success case prop encoding time : 0.000
% 573.24/300.13 # Success case prop solver time : 0.000
% 573.24/300.13 # Current number of processed clauses : 48
% 573.24/300.13 # Positive orientable unit clauses : 9
% 573.24/300.13 # Positive unorientable unit clauses: 1
% 573.24/300.13 # Negative unit clauses : 6
% 573.24/300.13 # Non-unit-clauses : 32
% 573.24/300.13 # Current number of unprocessed clauses: 34
% 573.24/300.13 # ...number of literals in the above : 75
% 573.24/300.13 # Current number of archived formulas : 0
% 573.24/300.13 # Current number of archived clauses : 21
% 573.24/300.13 # Clause-clause subsumption calls (NU) : 196
% 573.24/300.13 # Rec. Clause-clause subsumption calls : 148
% 573.24/300.13 # Non-unit clause-clause subsumptions : 0
% 573.24/300.13 # Unit Clause-clause subsumption calls : 25
% 573.24/300.13 # Rewrite failures with RHS unbound : 0
% 573.24/300.13 # BW rewrite match attempts : 8
% 573.24/300.13 # BW rewrite match successes : 4
% 573.24/300.13 # Condensation attempts : 0
% 573.24/300.13 # Condensation successes : 0
% 573.24/300.13 # Termbank termtop insertions : 2387
% 573.24/300.13
% 573.24/300.13 # -------------------------------------------------
% 573.24/300.13 # User time : 0.007 s
% 573.24/300.13 # System time : 0.002 s
% 573.24/300.13 # Total time : 0.008 s
% 573.24/300.13 # Maximum resident set size: 1744 pages
% 573.24/300.13
% 573.24/300.13 # -------------------------------------------------
% 573.24/300.13 # User time : 0.007 s
% 573.24/300.13 # System time : 0.004 s
% 573.24/300.13 # Total time : 0.011 s
% 573.24/300.13 # Maximum resident set size: 1684 pages
% 573.24/300.13 % E---3.1 exiting
% 573.24/300.13 % E---3.1 exiting
%------------------------------------------------------------------------------