TSTP Solution File: SET914+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET914+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:22 EDT 2023
% Result : Theorem 0.16s 0.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 7 unt; 0 def)
% Number of atoms : 97 ( 37 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 113 ( 44 ~; 45 |; 16 &)
% ( 7 <=>; 1 =>; 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; 4 con; 0-3 aty)
% Number of variables : 66 ( 4 sgn; 45 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t55_zfmisc_1,conjecture,
! [X1,X2,X3] :
~ ( disjoint(unordered_pair(X1,X2),X3)
& in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.UTNXDabfgQ/E---3.1_29658.p',t55_zfmisc_1) ).
fof(symmetry_r1_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
=> disjoint(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.UTNXDabfgQ/E---3.1_29658.p',symmetry_r1_xboole_0) ).
fof(d1_xboole_0,axiom,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.UTNXDabfgQ/E---3.1_29658.p',d1_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.UTNXDabfgQ/E---3.1_29658.p',d3_xboole_0) ).
fof(d7_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_intersection2(X1,X2) = empty_set ),
file('/export/starexec/sandbox2/tmp/tmp.UTNXDabfgQ/E---3.1_29658.p',d7_xboole_0) ).
fof(d2_tarski,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X1
| X4 = X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.UTNXDabfgQ/E---3.1_29658.p',d2_tarski) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X3] :
~ ( disjoint(unordered_pair(X1,X2),X3)
& in(X1,X3) ),
inference(assume_negation,[status(cth)],[t55_zfmisc_1]) ).
fof(c_0_7,plain,
! [X21,X22] :
( ~ disjoint(X21,X22)
| disjoint(X22,X21) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[symmetry_r1_xboole_0])]) ).
fof(c_0_8,negated_conjecture,
( disjoint(unordered_pair(esk1_0,esk2_0),esk3_0)
& in(esk1_0,esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_9,plain,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[d1_xboole_0]) ).
fof(c_0_10,plain,
! [X10,X11,X12,X13,X14,X15,X16,X17] :
( ( in(X13,X10)
| ~ in(X13,X12)
| X12 != set_intersection2(X10,X11) )
& ( in(X13,X11)
| ~ in(X13,X12)
| X12 != set_intersection2(X10,X11) )
& ( ~ in(X14,X10)
| ~ in(X14,X11)
| in(X14,X12)
| X12 != set_intersection2(X10,X11) )
& ( ~ in(esk4_3(X15,X16,X17),X17)
| ~ in(esk4_3(X15,X16,X17),X15)
| ~ in(esk4_3(X15,X16,X17),X16)
| X17 = set_intersection2(X15,X16) )
& ( in(esk4_3(X15,X16,X17),X15)
| in(esk4_3(X15,X16,X17),X17)
| X17 = set_intersection2(X15,X16) )
& ( in(esk4_3(X15,X16,X17),X16)
| in(esk4_3(X15,X16,X17),X17)
| X17 = set_intersection2(X15,X16) ) ),
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_11,plain,
! [X19,X20] :
( ( ~ disjoint(X19,X20)
| set_intersection2(X19,X20) = empty_set )
& ( set_intersection2(X19,X20) != empty_set
| disjoint(X19,X20) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d7_xboole_0])]) ).
cnf(c_0_12,plain,
( disjoint(X2,X1)
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
disjoint(unordered_pair(esk1_0,esk2_0),esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_14,plain,
! [X37,X38,X39] :
( ( X37 != empty_set
| ~ in(X38,X37) )
& ( in(esk6_1(X39),X39)
| X39 = 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_9])])])])]) ).
cnf(c_0_15,plain,
( in(X1,X4)
| ~ in(X1,X2)
| ~ in(X1,X3)
| X4 != set_intersection2(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( set_intersection2(X1,X2) = empty_set
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
disjoint(esk3_0,unordered_pair(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_19,plain,
! [X25,X26,X27,X28,X29,X30,X31,X32] :
( ( ~ in(X28,X27)
| X28 = X25
| X28 = X26
| X27 != unordered_pair(X25,X26) )
& ( X29 != X25
| in(X29,X27)
| X27 != unordered_pair(X25,X26) )
& ( X29 != X26
| in(X29,X27)
| X27 != unordered_pair(X25,X26) )
& ( esk5_3(X30,X31,X32) != X30
| ~ in(esk5_3(X30,X31,X32),X32)
| X32 = unordered_pair(X30,X31) )
& ( esk5_3(X30,X31,X32) != X31
| ~ in(esk5_3(X30,X31,X32),X32)
| X32 = unordered_pair(X30,X31) )
& ( in(esk5_3(X30,X31,X32),X32)
| esk5_3(X30,X31,X32) = X30
| esk5_3(X30,X31,X32) = X31
| X32 = unordered_pair(X30,X31) ) ),
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_tarski])])])])])]) ).
cnf(c_0_20,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
set_intersection2(esk3_0,unordered_pair(esk1_0,esk2_0)) = empty_set,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
~ in(X1,empty_set),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
( in(X1,X3)
| X1 != X2
| X3 != unordered_pair(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( ~ in(X1,unordered_pair(esk1_0,esk2_0))
| ~ in(X1,esk3_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_25,plain,
in(X1,unordered_pair(X1,X2)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_23])]) ).
cnf(c_0_26,negated_conjecture,
in(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SET914+1 : TPTP v8.1.2. Released v3.2.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n018.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 17:23:39 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.16/0.43 Running first-order model finding
% 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 --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.UTNXDabfgQ/E---3.1_29658.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 # new_bool_3 with pid 29736 completed with status 0
% 0.16/0.45 # Result found by new_bool_3
% 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 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45 # Search class: FGHSS-FFMS32-SFFFFFNN
% 0.16/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 131s (1) cores
% 0.16/0.45 # SAT001_MinMin_p005000_rr_RG with pid 29740 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 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45 # Search class: FGHSS-FFMS32-SFFFFFNN
% 0.16/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 131s (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 : 13
% 0.16/0.45 # Removed by relevancy pruning/SinE : 0
% 0.16/0.45 # Initial clauses : 26
% 0.16/0.45 # Removed in clause preprocessing : 0
% 0.16/0.45 # Initial clauses in saturation : 26
% 0.16/0.45 # Processed clauses : 67
% 0.16/0.45 # ...of these trivial : 0
% 0.16/0.45 # ...subsumed : 5
% 0.16/0.45 # ...remaining for further processing : 62
% 0.16/0.45 # Other redundant clauses eliminated : 9
% 0.16/0.45 # Clauses deleted for lack of memory : 0
% 0.16/0.45 # Backward-subsumed : 0
% 0.16/0.45 # Backward-rewritten : 1
% 0.16/0.45 # Generated clauses : 54
% 0.16/0.45 # ...of the previous two non-redundant : 40
% 0.16/0.45 # ...aggressively subsumed : 0
% 0.16/0.45 # Contextual simplify-reflections : 0
% 0.16/0.45 # Paramodulations : 47
% 0.16/0.45 # Factorizations : 0
% 0.16/0.45 # NegExts : 0
% 0.16/0.45 # Equation resolutions : 9
% 0.16/0.45 # Total rewrite steps : 10
% 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 : 28
% 0.16/0.45 # Positive orientable unit clauses : 9
% 0.16/0.45 # Positive unorientable unit clauses: 2
% 0.16/0.45 # Negative unit clauses : 5
% 0.16/0.45 # Non-unit-clauses : 12
% 0.16/0.45 # Current number of unprocessed clauses: 23
% 0.16/0.45 # ...number of literals in the above : 60
% 0.16/0.45 # Current number of archived formulas : 0
% 0.16/0.45 # Current number of archived clauses : 27
% 0.16/0.45 # Clause-clause subsumption calls (NU) : 42
% 0.16/0.45 # Rec. Clause-clause subsumption calls : 38
% 0.16/0.45 # Non-unit clause-clause subsumptions : 1
% 0.16/0.45 # Unit Clause-clause subsumption calls : 3
% 0.16/0.45 # Rewrite failures with RHS unbound : 0
% 0.16/0.45 # BW rewrite match attempts : 24
% 0.16/0.45 # BW rewrite match successes : 22
% 0.16/0.45 # Condensation attempts : 0
% 0.16/0.45 # Condensation successes : 0
% 0.16/0.45 # Termbank termtop insertions : 1685
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.006 s
% 0.16/0.45 # System time : 0.001 s
% 0.16/0.45 # Total time : 0.007 s
% 0.16/0.45 # Maximum resident set size: 1712 pages
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.008 s
% 0.16/0.45 # System time : 0.002 s
% 0.16/0.45 # Total time : 0.011 s
% 0.16/0.45 # Maximum resident set size: 1680 pages
% 0.16/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------