TSTP Solution File: SET916+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET916+1 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 03:00:24 EDT 2024
% Result : Theorem 1.69s 0.69s
% Output : CNFRefutation 1.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 4 unt; 0 def)
% Number of atoms : 105 ( 34 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 133 ( 54 ~; 51 |; 24 &)
% ( 4 <=>; 0 =>; 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 : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 79 ( 4 sgn 41 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
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/sandbox/benchmark/theBenchmark.p',t4_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/sandbox/benchmark/theBenchmark.p',d2_tarski) ).
fof(t57_zfmisc_1,conjecture,
! [X1,X2,X3] :
~ ( ~ in(X1,X2)
& ~ in(X3,X2)
& ~ disjoint(unordered_pair(X1,X3),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t57_zfmisc_1) ).
fof(c_0_4,plain,
! [X20,X21,X22,X23,X24,X25,X26,X27] :
( ( in(X23,X20)
| ~ in(X23,X22)
| X22 != set_intersection2(X20,X21) )
& ( in(X23,X21)
| ~ in(X23,X22)
| X22 != set_intersection2(X20,X21) )
& ( ~ in(X24,X20)
| ~ in(X24,X21)
| in(X24,X22)
| X22 != set_intersection2(X20,X21) )
& ( ~ in(esk2_3(X25,X26,X27),X27)
| ~ in(esk2_3(X25,X26,X27),X25)
| ~ in(esk2_3(X25,X26,X27),X26)
| X27 = set_intersection2(X25,X26) )
& ( in(esk2_3(X25,X26,X27),X25)
| in(esk2_3(X25,X26,X27),X27)
| X27 = set_intersection2(X25,X26) )
& ( in(esk2_3(X25,X26,X27),X26)
| in(esk2_3(X25,X26,X27),X27)
| X27 = set_intersection2(X25,X26) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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_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,
! [X11,X12,X13,X14,X15,X16,X17,X18] :
( ( ~ in(X14,X13)
| X14 = X11
| X14 = X12
| X13 != unordered_pair(X11,X12) )
& ( X15 != X11
| in(X15,X13)
| X13 != unordered_pair(X11,X12) )
& ( X15 != X12
| in(X15,X13)
| X13 != unordered_pair(X11,X12) )
& ( esk1_3(X16,X17,X18) != X16
| ~ in(esk1_3(X16,X17,X18),X18)
| X18 = unordered_pair(X16,X17) )
& ( esk1_3(X16,X17,X18) != X17
| ~ in(esk1_3(X16,X17,X18),X18)
| X18 = unordered_pair(X16,X17) )
& ( in(esk1_3(X16,X17,X18),X18)
| esk1_3(X16,X17,X18) = X16
| esk1_3(X16,X17,X18) = X17
| X18 = unordered_pair(X16,X17) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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_7,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_intersection2(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_8,plain,
! [X34,X35,X37,X38,X39] :
( ( disjoint(X34,X35)
| in(esk5_2(X34,X35),set_intersection2(X34,X35)) )
& ( ~ in(X39,set_intersection2(X37,X38))
| ~ disjoint(X37,X38) ) ),
inference(fof_nnf,[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)],[c_0_5])])])])])]) ).
cnf(c_0_9,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_intersection2(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,plain,
( X1 = X3
| X1 = X4
| ~ in(X1,X2)
| X2 != unordered_pair(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X2,X3)) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( disjoint(X1,X2)
| in(esk5_2(X1,X2),set_intersection2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X3,X2)) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( X1 = X2
| X1 = X3
| ~ in(X1,unordered_pair(X3,X2)) ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( disjoint(X1,X2)
| in(esk5_2(X1,X2),X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_16,negated_conjecture,
~ ! [X1,X2,X3] :
~ ( ~ in(X1,X2)
& ~ in(X3,X2)
& ~ disjoint(unordered_pair(X1,X3),X2) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t57_zfmisc_1])]) ).
cnf(c_0_17,plain,
( disjoint(X1,X2)
| in(esk5_2(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_18,plain,
( esk5_2(unordered_pair(X1,X2),X3) = X2
| esk5_2(unordered_pair(X1,X2),X3) = X1
| disjoint(unordered_pair(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_19,negated_conjecture,
( ~ in(esk6_0,esk7_0)
& ~ in(esk8_0,esk7_0)
& ~ disjoint(unordered_pair(esk6_0,esk8_0),esk7_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).
cnf(c_0_20,plain,
( esk5_2(unordered_pair(X1,X2),X3) = X2
| disjoint(unordered_pair(X1,X2),X3)
| in(X1,X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
~ disjoint(unordered_pair(esk6_0,esk8_0),esk7_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_22,plain,
( disjoint(unordered_pair(X1,X2),X3)
| in(X1,X3)
| in(X2,X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
~ in(esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
~ in(esk8_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET916+1 : TPTP v8.2.0. Released v3.2.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n029.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 : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 13:27:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 1.69/0.69 # Version: 3.1.0
% 1.69/0.69 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.69/0.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.69/0.69 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.69/0.69 # Starting new_bool_3 with 300s (1) cores
% 1.69/0.69 # Starting new_bool_1 with 300s (1) cores
% 1.69/0.69 # Starting sh5l with 300s (1) cores
% 1.69/0.69 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 10412 completed with status 0
% 1.69/0.69 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.69/0.69 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.69/0.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.69/0.69 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.69/0.69 # No SInE strategy applied
% 1.69/0.69 # Search class: FGHSS-FFMF32-SFFFFFNN
% 1.69/0.69 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.69/0.69 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 511s (1) cores
% 1.69/0.69 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.69/0.69 # Starting new_bool_3 with 248s (1) cores
% 1.69/0.69 # Starting new_bool_1 with 241s (1) cores
% 1.69/0.69 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.69/0.69 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 10416 completed with status 0
% 1.69/0.69 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 1.69/0.69 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.69/0.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.69/0.69 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.69/0.69 # No SInE strategy applied
% 1.69/0.69 # Search class: FGHSS-FFMF32-SFFFFFNN
% 1.69/0.69 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.69/0.69 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 511s (1) cores
% 1.69/0.69 # Preprocessing time : 0.002 s
% 1.69/0.69 # Presaturation interreduction done
% 1.69/0.69
% 1.69/0.69 # Proof found!
% 1.69/0.69 # SZS status Theorem
% 1.69/0.69 # SZS output start CNFRefutation
% See solution above
% 1.69/0.69 # Parsed axioms : 11
% 1.69/0.69 # Removed by relevancy pruning/SinE : 0
% 1.69/0.69 # Initial clauses : 24
% 1.69/0.69 # Removed in clause preprocessing : 0
% 1.69/0.69 # Initial clauses in saturation : 24
% 1.69/0.69 # Processed clauses : 2061
% 1.69/0.69 # ...of these trivial : 2
% 1.69/0.69 # ...subsumed : 1722
% 1.69/0.69 # ...remaining for further processing : 337
% 1.69/0.69 # Other redundant clauses eliminated : 36
% 1.69/0.69 # Clauses deleted for lack of memory : 0
% 1.69/0.69 # Backward-subsumed : 1
% 1.69/0.69 # Backward-rewritten : 0
% 1.69/0.69 # Generated clauses : 9015
% 1.69/0.69 # ...of the previous two non-redundant : 8723
% 1.69/0.69 # ...aggressively subsumed : 0
% 1.69/0.69 # Contextual simplify-reflections : 1
% 1.69/0.69 # Paramodulations : 8939
% 1.69/0.69 # Factorizations : 42
% 1.69/0.69 # NegExts : 0
% 1.69/0.69 # Equation resolutions : 36
% 1.69/0.69 # Disequality decompositions : 0
% 1.69/0.69 # Total rewrite steps : 431
% 1.69/0.69 # ...of those cached : 397
% 1.69/0.69 # Propositional unsat checks : 0
% 1.69/0.69 # Propositional check models : 0
% 1.69/0.69 # Propositional check unsatisfiable : 0
% 1.69/0.69 # Propositional clauses : 0
% 1.69/0.69 # Propositional clauses after purity: 0
% 1.69/0.69 # Propositional unsat core size : 0
% 1.69/0.69 # Propositional preprocessing time : 0.000
% 1.69/0.69 # Propositional encoding time : 0.000
% 1.69/0.69 # Propositional solver time : 0.000
% 1.69/0.69 # Success case prop preproc time : 0.000
% 1.69/0.69 # Success case prop encoding time : 0.000
% 1.69/0.69 # Success case prop solver time : 0.000
% 1.69/0.69 # Current number of processed clauses : 306
% 1.69/0.69 # Positive orientable unit clauses : 6
% 1.69/0.69 # Positive unorientable unit clauses: 2
% 1.69/0.69 # Negative unit clauses : 6
% 1.69/0.69 # Non-unit-clauses : 292
% 1.69/0.69 # Current number of unprocessed clauses: 6678
% 1.69/0.69 # ...number of literals in the above : 20194
% 1.69/0.69 # Current number of archived formulas : 0
% 1.69/0.69 # Current number of archived clauses : 25
% 1.69/0.69 # Clause-clause subsumption calls (NU) : 22372
% 1.69/0.69 # Rec. Clause-clause subsumption calls : 19681
% 1.69/0.69 # Non-unit clause-clause subsumptions : 1644
% 1.69/0.69 # Unit Clause-clause subsumption calls : 66
% 1.69/0.69 # Rewrite failures with RHS unbound : 0
% 1.69/0.69 # BW rewrite match attempts : 27
% 1.69/0.69 # BW rewrite match successes : 16
% 1.69/0.69 # Condensation attempts : 0
% 1.69/0.69 # Condensation successes : 0
% 1.69/0.69 # Termbank termtop insertions : 103980
% 1.69/0.69 # Search garbage collected termcells : 417
% 1.69/0.69
% 1.69/0.69 # -------------------------------------------------
% 1.69/0.69 # User time : 0.191 s
% 1.69/0.69 # System time : 0.009 s
% 1.69/0.69 # Total time : 0.200 s
% 1.69/0.69 # Maximum resident set size: 1744 pages
% 1.69/0.69
% 1.69/0.69 # -------------------------------------------------
% 1.69/0.69 # User time : 0.960 s
% 1.69/0.69 # System time : 0.028 s
% 1.69/0.69 # Total time : 0.989 s
% 1.69/0.69 # Maximum resident set size: 1700 pages
% 1.69/0.69 % E---3.1 exiting
%------------------------------------------------------------------------------