TSTP Solution File: SET957+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET957+1 : TPTP v8.1.2. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:24 EDT 2023
% Result : Theorem 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 6 unt; 0 def)
% Number of atoms : 74 ( 13 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 81 ( 30 ~; 30 |; 15 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-4 aty)
% Number of variables : 56 ( 4 sgn; 33 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t110_zfmisc_1,conjecture,
! [X1,X2,X3,X4,X5,X6] :
( ( subset(X1,cartesian_product2(X2,X3))
& subset(X4,cartesian_product2(X5,X6))
& ! [X7,X8] :
( in(ordered_pair(X7,X8),X1)
<=> in(ordered_pair(X7,X8),X4) ) )
=> X1 = X4 ),
file('/export/starexec/sandbox2/tmp/tmp.kVLBG2dM6z/E---3.1_18435.p',t110_zfmisc_1) ).
fof(t103_zfmisc_1,axiom,
! [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.kVLBG2dM6z/E---3.1_18435.p',t103_zfmisc_1) ).
fof(t2_tarski,axiom,
! [X1,X2] :
( ! [X3] :
( in(X3,X1)
<=> in(X3,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/tmp/tmp.kVLBG2dM6z/E---3.1_18435.p',t2_tarski) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3,X4,X5,X6] :
( ( subset(X1,cartesian_product2(X2,X3))
& subset(X4,cartesian_product2(X5,X6))
& ! [X7,X8] :
( in(ordered_pair(X7,X8),X1)
<=> in(ordered_pair(X7,X8),X4) ) )
=> X1 = X4 ),
inference(assume_negation,[status(cth)],[t110_zfmisc_1]) ).
fof(c_0_4,negated_conjecture,
! [X15,X16] :
( subset(esk1_0,cartesian_product2(esk2_0,esk3_0))
& subset(esk4_0,cartesian_product2(esk5_0,esk6_0))
& ( ~ in(ordered_pair(X15,X16),esk1_0)
| in(ordered_pair(X15,X16),esk4_0) )
& ( ~ in(ordered_pair(X15,X16),esk4_0)
| in(ordered_pair(X15,X16),esk1_0) )
& esk1_0 != esk4_0 ),
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,
! [X19,X20,X21,X22] :
( ( in(esk7_4(X19,X20,X21,X22),X20)
| ~ subset(X19,cartesian_product2(X20,X21))
| ~ in(X22,X19) )
& ( in(esk8_4(X19,X20,X21,X22),X21)
| ~ subset(X19,cartesian_product2(X20,X21))
| ~ in(X22,X19) )
& ( X22 = ordered_pair(esk7_4(X19,X20,X21,X22),esk8_4(X19,X20,X21,X22))
| ~ subset(X19,cartesian_product2(X20,X21))
| ~ in(X22,X19) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t103_zfmisc_1])])])]) ).
cnf(c_0_6,negated_conjecture,
( in(ordered_pair(X1,X2),esk1_0)
| ~ in(ordered_pair(X1,X2),esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( X1 = ordered_pair(esk7_4(X2,X3,X4,X1),esk8_4(X2,X3,X4,X1))
| ~ subset(X2,cartesian_product2(X3,X4))
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( in(X1,esk1_0)
| ~ subset(X2,cartesian_product2(X3,X4))
| ~ in(X1,esk4_0)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,negated_conjecture,
subset(esk4_0,cartesian_product2(esk5_0,esk6_0)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_10,plain,
! [X25,X26] :
( ( ~ in(esk9_2(X25,X26),X25)
| ~ in(esk9_2(X25,X26),X26)
| X25 = X26 )
& ( in(esk9_2(X25,X26),X25)
| in(esk9_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_11,negated_conjecture,
( in(X1,esk1_0)
| ~ in(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( in(esk9_2(X1,X2),X1)
| in(esk9_2(X1,X2),X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
( esk4_0 = X1
| in(esk9_2(esk4_0,X1),esk1_0)
| in(esk9_2(esk4_0,X1),X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,negated_conjecture,
esk1_0 != esk4_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,negated_conjecture,
( in(ordered_pair(X1,X2),esk4_0)
| ~ in(ordered_pair(X1,X2),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,plain,
( X1 = X2
| ~ in(esk9_2(X1,X2),X1)
| ~ in(esk9_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
in(esk9_2(esk4_0,esk1_0),esk1_0),
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_13]),c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( in(X1,esk4_0)
| ~ subset(X2,cartesian_product2(X3,X4))
| ~ in(X1,esk1_0)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_7]) ).
cnf(c_0_19,negated_conjecture,
subset(esk1_0,cartesian_product2(esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_20,negated_conjecture,
~ in(esk9_2(esk4_0,esk1_0),esk4_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_14]) ).
cnf(c_0_21,negated_conjecture,
( in(X1,esk4_0)
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET957+1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 16:56:27 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.19/0.48 Running first-order theorem proving
% 0.19/0.48 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.kVLBG2dM6z/E---3.1_18435.p
% 0.19/0.49 # Version: 3.1pre001
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # sh5l with pid 18516 completed with status 0
% 0.19/0.49 # Result found by sh5l
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.49 # Search class: FGHSS-FFSS32-SFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.49 # SAT001_MinMin_p005000_rr_RG with pid 18517 completed with status 0
% 0.19/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.49 # Search class: FGHSS-FFSS32-SFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.49 # Preprocessing time : 0.001 s
% 0.19/0.49 # Presaturation interreduction done
% 0.19/0.49
% 0.19/0.49 # Proof found!
% 0.19/0.49 # SZS status Theorem
% 0.19/0.49 # SZS output start CNFRefutation
% See solution above
% 0.19/0.50 # Parsed axioms : 10
% 0.19/0.50 # Removed by relevancy pruning/SinE : 0
% 0.19/0.50 # Initial clauses : 17
% 0.19/0.50 # Removed in clause preprocessing : 0
% 0.19/0.50 # Initial clauses in saturation : 17
% 0.19/0.50 # Processed clauses : 71
% 0.19/0.50 # ...of these trivial : 3
% 0.19/0.50 # ...subsumed : 2
% 0.19/0.50 # ...remaining for further processing : 66
% 0.19/0.50 # Other redundant clauses eliminated : 0
% 0.19/0.50 # Clauses deleted for lack of memory : 0
% 0.19/0.50 # Backward-subsumed : 6
% 0.19/0.50 # Backward-rewritten : 0
% 0.19/0.50 # Generated clauses : 103
% 0.19/0.50 # ...of the previous two non-redundant : 84
% 0.19/0.50 # ...aggressively subsumed : 0
% 0.19/0.50 # Contextual simplify-reflections : 0
% 0.19/0.50 # Paramodulations : 99
% 0.19/0.50 # Factorizations : 4
% 0.19/0.50 # NegExts : 0
% 0.19/0.50 # Equation resolutions : 0
% 0.19/0.50 # Total rewrite steps : 15
% 0.19/0.50 # Propositional unsat checks : 0
% 0.19/0.50 # Propositional check models : 0
% 0.19/0.50 # Propositional check unsatisfiable : 0
% 0.19/0.50 # Propositional clauses : 0
% 0.19/0.50 # Propositional clauses after purity: 0
% 0.19/0.50 # Propositional unsat core size : 0
% 0.19/0.50 # Propositional preprocessing time : 0.000
% 0.19/0.50 # Propositional encoding time : 0.000
% 0.19/0.50 # Propositional solver time : 0.000
% 0.19/0.50 # Success case prop preproc time : 0.000
% 0.19/0.50 # Success case prop encoding time : 0.000
% 0.19/0.50 # Success case prop solver time : 0.000
% 0.19/0.50 # Current number of processed clauses : 43
% 0.19/0.50 # Positive orientable unit clauses : 11
% 0.19/0.50 # Positive unorientable unit clauses: 1
% 0.19/0.50 # Negative unit clauses : 8
% 0.19/0.50 # Non-unit-clauses : 23
% 0.19/0.50 # Current number of unprocessed clauses: 43
% 0.19/0.50 # ...number of literals in the above : 61
% 0.19/0.50 # Current number of archived formulas : 0
% 0.19/0.50 # Current number of archived clauses : 23
% 0.19/0.50 # Clause-clause subsumption calls (NU) : 229
% 0.19/0.50 # Rec. Clause-clause subsumption calls : 151
% 0.19/0.50 # Non-unit clause-clause subsumptions : 7
% 0.19/0.50 # Unit Clause-clause subsumption calls : 63
% 0.19/0.50 # Rewrite failures with RHS unbound : 0
% 0.19/0.50 # BW rewrite match attempts : 8
% 0.19/0.50 # BW rewrite match successes : 4
% 0.19/0.50 # Condensation attempts : 0
% 0.19/0.50 # Condensation successes : 0
% 0.19/0.50 # Termbank termtop insertions : 2165
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.007 s
% 0.19/0.50 # System time : 0.001 s
% 0.19/0.50 # Total time : 0.008 s
% 0.19/0.50 # Maximum resident set size: 1712 pages
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.007 s
% 0.19/0.50 # System time : 0.004 s
% 0.19/0.50 # Total time : 0.011 s
% 0.19/0.50 # Maximum resident set size: 1680 pages
% 0.19/0.50 % E---3.1 exiting
% 0.19/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------