TSTP Solution File: SET945+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET945+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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 : Theorem 0.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 36 ( 2 unt; 0 def)
% Number of atoms : 130 ( 19 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 162 ( 68 ~; 65 |; 20 &)
% ( 4 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-3 aty)
% Number of variables : 102 ( 5 sgn; 45 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t4_xboole_0,axiom,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] : ~ in(X3,set_intersection2(X1,X2)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X1,X2))
& disjoint(X1,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.B3nJTC1Ek6/E---3.1_32465.p',t4_xboole_0) ).
fof(d3_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_intersection2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& in(X4,X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.B3nJTC1Ek6/E---3.1_32465.p',d3_xboole_0) ).
fof(t98_zfmisc_1,conjecture,
! [X1,X2] :
( ! [X3] :
( in(X3,X1)
=> disjoint(X3,X2) )
=> disjoint(union(X1),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.B3nJTC1Ek6/E---3.1_32465.p',t98_zfmisc_1) ).
fof(symmetry_r1_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
=> disjoint(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.B3nJTC1Ek6/E---3.1_32465.p',symmetry_r1_xboole_0) ).
fof(d4_tarski,axiom,
! [X1,X2] :
( X2 = union(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(X3,X4)
& in(X4,X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.B3nJTC1Ek6/E---3.1_32465.p',d4_tarski) ).
fof(c_0_5,plain,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] : ~ in(X3,set_intersection2(X1,X2)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X1,X2))
& disjoint(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[t4_xboole_0]) ).
fof(c_0_6,plain,
! [X9,X10,X11,X12,X13,X14,X15,X16] :
( ( in(X12,X9)
| ~ in(X12,X11)
| X11 != set_intersection2(X9,X10) )
& ( in(X12,X10)
| ~ in(X12,X11)
| X11 != set_intersection2(X9,X10) )
& ( ~ in(X13,X9)
| ~ in(X13,X10)
| in(X13,X11)
| X11 != set_intersection2(X9,X10) )
& ( ~ in(esk1_3(X14,X15,X16),X16)
| ~ in(esk1_3(X14,X15,X16),X14)
| ~ in(esk1_3(X14,X15,X16),X15)
| X16 = set_intersection2(X14,X15) )
& ( in(esk1_3(X14,X15,X16),X14)
| in(esk1_3(X14,X15,X16),X16)
| X16 = set_intersection2(X14,X15) )
& ( in(esk1_3(X14,X15,X16),X15)
| in(esk1_3(X14,X15,X16),X16)
| X16 = set_intersection2(X14,X15) ) ),
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_xboole_0])])])])])]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2] :
( ! [X3] :
( in(X3,X1)
=> disjoint(X3,X2) )
=> disjoint(union(X1),X2) ),
inference(assume_negation,[status(cth)],[t98_zfmisc_1]) ).
fof(c_0_8,plain,
! [X34,X35,X37,X38,X39] :
( ( disjoint(X34,X35)
| in(esk7_2(X34,X35),set_intersection2(X34,X35)) )
& ( ~ in(X39,set_intersection2(X37,X38))
| ~ disjoint(X37,X38) ) ),
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_5])])])])]) ).
cnf(c_0_9,plain,
( in(X1,X4)
| ~ in(X1,X2)
| ~ in(X1,X3)
| X4 != set_intersection2(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X32,X33] :
( ~ disjoint(X32,X33)
| disjoint(X33,X32) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[symmetry_r1_xboole_0])]) ).
fof(c_0_11,negated_conjecture,
! [X42] :
( ( ~ in(X42,esk8_0)
| disjoint(X42,esk9_0) )
& ~ disjoint(union(esk8_0),esk9_0) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_12,plain,
( ~ in(X1,set_intersection2(X2,X3))
| ~ disjoint(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( disjoint(X2,X1)
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
( disjoint(X1,esk9_0)
| ~ in(X1,esk8_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_intersection2(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,plain,
( ~ disjoint(X1,X2)
| ~ in(X3,X2)
| ~ in(X3,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
( disjoint(esk9_0,X1)
| ~ in(X1,esk8_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X3,X2)) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
( disjoint(X1,X2)
| in(esk7_2(X1,X2),set_intersection2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_21,plain,
! [X18,X19,X20,X22,X23,X24,X25,X27] :
( ( in(X20,esk2_3(X18,X19,X20))
| ~ in(X20,X19)
| X19 != union(X18) )
& ( in(esk2_3(X18,X19,X20),X18)
| ~ in(X20,X19)
| X19 != union(X18) )
& ( ~ in(X22,X23)
| ~ in(X23,X18)
| in(X22,X19)
| X19 != union(X18) )
& ( ~ in(esk3_2(X24,X25),X25)
| ~ in(esk3_2(X24,X25),X27)
| ~ in(X27,X24)
| X25 = union(X24) )
& ( in(esk3_2(X24,X25),esk4_2(X24,X25))
| in(esk3_2(X24,X25),X25)
| X25 = union(X24) )
& ( in(esk4_2(X24,X25),X24)
| in(esk3_2(X24,X25),X25)
| X25 = union(X24) ) ),
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)],[d4_tarski])])])])])]) ).
cnf(c_0_22,negated_conjecture,
( ~ in(X1,esk9_0)
| ~ in(X2,esk8_0)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( disjoint(X1,X2)
| in(esk7_2(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( in(X1,esk2_3(X2,X3,X1))
| ~ in(X1,X3)
| X3 != union(X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( disjoint(X1,esk9_0)
| ~ in(esk7_2(X1,esk9_0),X2)
| ~ in(X2,esk8_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
( in(X1,esk2_3(X2,union(X2),X1))
| ~ in(X1,union(X2)) ),
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_27,plain,
( in(esk2_3(X1,X2,X3),X1)
| ~ in(X3,X2)
| X2 != union(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_intersection2(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_29,negated_conjecture,
( disjoint(X1,esk9_0)
| ~ in(esk2_3(X2,union(X2),esk7_2(X1,esk9_0)),esk8_0)
| ~ in(esk7_2(X1,esk9_0),union(X2)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
( in(esk2_3(X1,union(X1),X2),X1)
| ~ in(X2,union(X1)) ),
inference(er,[status(thm)],[c_0_27]) ).
cnf(c_0_31,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X2,X3)) ),
inference(er,[status(thm)],[c_0_28]) ).
cnf(c_0_32,negated_conjecture,
( disjoint(X1,esk9_0)
| ~ in(esk7_2(X1,esk9_0),union(esk8_0)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
( disjoint(X1,X2)
| in(esk7_2(X1,X2),X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_20]) ).
cnf(c_0_34,negated_conjecture,
~ disjoint(union(esk8_0),esk9_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SET945+1 : TPTP v8.1.2. Released v3.2.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n031.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.31 % CPULimit : 2400
% 0.15/0.31 % WCLimit : 300
% 0.15/0.31 % DateTime : Mon Oct 2 17:11:28 EDT 2023
% 0.15/0.31 % CPUTime :
% 0.16/0.41 Running first-order model finding
% 0.16/0.41 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.B3nJTC1Ek6/E---3.1_32465.p
% 0.16/0.44 # Version: 3.1pre001
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # Starting sh5l with 300s (1) cores
% 0.16/0.44 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 32542 completed with status 0
% 0.16/0.44 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # No SInE strategy applied
% 0.16/0.44 # Search class: FGHSS-FFMF32-SFFFFFNN
% 0.16/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.44 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 511s (1) cores
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.44 # Starting new_bool_3 with 248s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 241s (1) cores
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.44 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 32546 completed with status 0
% 0.16/0.44 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # No SInE strategy applied
% 0.16/0.44 # Search class: FGHSS-FFMF32-SFFFFFNN
% 0.16/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.44 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 511s (1) cores
% 0.16/0.44 # Preprocessing time : 0.001 s
% 0.16/0.44 # Presaturation interreduction done
% 0.16/0.44
% 0.16/0.44 # Proof found!
% 0.16/0.44 # SZS status Theorem
% 0.16/0.44 # SZS output start CNFRefutation
% See solution above
% 0.16/0.44 # Parsed axioms : 10
% 0.16/0.44 # Removed by relevancy pruning/SinE : 0
% 0.16/0.44 # Initial clauses : 22
% 0.16/0.44 # Removed in clause preprocessing : 0
% 0.16/0.44 # Initial clauses in saturation : 22
% 0.16/0.44 # Processed clauses : 286
% 0.16/0.44 # ...of these trivial : 0
% 0.16/0.44 # ...subsumed : 147
% 0.16/0.44 # ...remaining for further processing : 139
% 0.16/0.44 # Other redundant clauses eliminated : 6
% 0.16/0.44 # Clauses deleted for lack of memory : 0
% 0.16/0.44 # Backward-subsumed : 3
% 0.16/0.44 # Backward-rewritten : 0
% 0.16/0.44 # Generated clauses : 805
% 0.16/0.44 # ...of the previous two non-redundant : 792
% 0.16/0.44 # ...aggressively subsumed : 0
% 0.16/0.44 # Contextual simplify-reflections : 0
% 0.16/0.44 # Paramodulations : 795
% 0.16/0.44 # Factorizations : 4
% 0.16/0.44 # NegExts : 0
% 0.16/0.44 # Equation resolutions : 6
% 0.16/0.44 # Total rewrite steps : 5
% 0.16/0.44 # Propositional unsat checks : 0
% 0.16/0.44 # Propositional check models : 0
% 0.16/0.44 # Propositional check unsatisfiable : 0
% 0.16/0.44 # Propositional clauses : 0
% 0.16/0.44 # Propositional clauses after purity: 0
% 0.16/0.44 # Propositional unsat core size : 0
% 0.16/0.44 # Propositional preprocessing time : 0.000
% 0.16/0.44 # Propositional encoding time : 0.000
% 0.16/0.44 # Propositional solver time : 0.000
% 0.16/0.44 # Success case prop preproc time : 0.000
% 0.16/0.44 # Success case prop encoding time : 0.000
% 0.16/0.44 # Success case prop solver time : 0.000
% 0.16/0.44 # Current number of processed clauses : 108
% 0.16/0.44 # Positive orientable unit clauses : 2
% 0.16/0.44 # Positive unorientable unit clauses: 1
% 0.16/0.44 # Negative unit clauses : 5
% 0.16/0.44 # Non-unit-clauses : 100
% 0.16/0.44 # Current number of unprocessed clauses: 545
% 0.16/0.44 # ...number of literals in the above : 1594
% 0.16/0.44 # Current number of archived formulas : 0
% 0.16/0.44 # Current number of archived clauses : 25
% 0.16/0.44 # Clause-clause subsumption calls (NU) : 1469
% 0.16/0.44 # Rec. Clause-clause subsumption calls : 1406
% 0.16/0.44 # Non-unit clause-clause subsumptions : 93
% 0.16/0.44 # Unit Clause-clause subsumption calls : 12
% 0.16/0.44 # Rewrite failures with RHS unbound : 0
% 0.16/0.44 # BW rewrite match attempts : 9
% 0.16/0.44 # BW rewrite match successes : 8
% 0.16/0.44 # Condensation attempts : 0
% 0.16/0.44 # Condensation successes : 0
% 0.16/0.44 # Termbank termtop insertions : 13038
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.014 s
% 0.16/0.44 # System time : 0.002 s
% 0.16/0.44 # Total time : 0.016 s
% 0.16/0.44 # Maximum resident set size: 1748 pages
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.083 s
% 0.16/0.44 # System time : 0.009 s
% 0.16/0.44 # Total time : 0.092 s
% 0.16/0.44 # Maximum resident set size: 1684 pages
% 0.16/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------