TSTP Solution File: SET983+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET983+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:27 EDT 2023
% Result : Theorem 0.17s 0.45s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 7 unt; 0 def)
% Number of atoms : 50 ( 11 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 55 ( 20 ~; 21 |; 10 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-3 aty)
% Number of variables : 46 ( 0 sgn; 30 !; 0 ?)
% 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/sandbox2/tmp/tmp.WqoiXZD2Us/E---3.1_8408.p',d3_xboole_0) ).
fof(t137_zfmisc_1,conjecture,
! [X1,X2,X3,X4,X5] :
( ( in(X1,cartesian_product2(X2,X3))
& in(X1,cartesian_product2(X4,X5)) )
=> in(X1,cartesian_product2(set_intersection2(X2,X4),set_intersection2(X3,X5))) ),
file('/export/starexec/sandbox2/tmp/tmp.WqoiXZD2Us/E---3.1_8408.p',t137_zfmisc_1) ).
fof(t123_zfmisc_1,axiom,
! [X1,X2,X3,X4] : cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4)) = set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4)),
file('/export/starexec/sandbox2/tmp/tmp.WqoiXZD2Us/E---3.1_8408.p',t123_zfmisc_1) ).
fof(c_0_3,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(esk1_3(X15,X16,X17),X17)
| ~ in(esk1_3(X15,X16,X17),X15)
| ~ in(esk1_3(X15,X16,X17),X16)
| X17 = set_intersection2(X15,X16) )
& ( in(esk1_3(X15,X16,X17),X15)
| in(esk1_3(X15,X16,X17),X17)
| X17 = set_intersection2(X15,X16) )
& ( in(esk1_3(X15,X16,X17),X16)
| in(esk1_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_4,negated_conjecture,
~ ! [X1,X2,X3,X4,X5] :
( ( in(X1,cartesian_product2(X2,X3))
& in(X1,cartesian_product2(X4,X5)) )
=> in(X1,cartesian_product2(set_intersection2(X2,X4),set_intersection2(X3,X5))) ),
inference(assume_negation,[status(cth)],[t137_zfmisc_1]) ).
cnf(c_0_5,plain,
( in(X1,X4)
| ~ in(X1,X2)
| ~ in(X1,X3)
| X4 != set_intersection2(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_6,plain,
! [X22,X23,X24,X25] : cartesian_product2(set_intersection2(X22,X23),set_intersection2(X24,X25)) = set_intersection2(cartesian_product2(X22,X24),cartesian_product2(X23,X25)),
inference(variable_rename,[status(thm)],[t123_zfmisc_1]) ).
fof(c_0_7,negated_conjecture,
( in(esk4_0,cartesian_product2(esk5_0,esk6_0))
& in(esk4_0,cartesian_product2(esk7_0,esk8_0))
& ~ in(esk4_0,cartesian_product2(set_intersection2(esk5_0,esk7_0),set_intersection2(esk6_0,esk8_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_8,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4)) = set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
~ in(esk4_0,cartesian_product2(set_intersection2(esk5_0,esk7_0),set_intersection2(esk6_0,esk8_0))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( in(X1,cartesian_product2(set_intersection2(X2,X3),set_intersection2(X4,X5)))
| ~ in(X1,cartesian_product2(X3,X5))
| ~ in(X1,cartesian_product2(X2,X4)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
in(esk4_0,cartesian_product2(esk7_0,esk8_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
in(esk4_0,cartesian_product2(esk5_0,esk6_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : SET983+1 : TPTP v8.1.2. Released v3.2.0.
% 0.05/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n011.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:12:38 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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.WqoiXZD2Us/E---3.1_8408.p
% 0.17/0.45 # Version: 3.1pre001
% 0.17/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.45 # Starting sh5l with 300s (1) cores
% 0.17/0.45 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 8486 completed with status 0
% 0.17/0.45 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.45 # No SInE strategy applied
% 0.17/0.45 # Search class: FGHSS-FFSS32-SFFFFFNN
% 0.17/0.45 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.45 # Starting new_bool_3 with 136s (1) cores
% 0.17/0.45 # Starting new_bool_1 with 136s (1) cores
% 0.17/0.45 # Starting sh5l with 136s (1) cores
% 0.17/0.45 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 8491 completed with status 0
% 0.17/0.45 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.45 # No SInE strategy applied
% 0.17/0.45 # Search class: FGHSS-FFSS32-SFFFFFNN
% 0.17/0.45 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.45 # Preprocessing time : 0.001 s
% 0.17/0.45 # Presaturation interreduction done
% 0.17/0.45
% 0.17/0.45 # Proof found!
% 0.17/0.45 # SZS status Theorem
% 0.17/0.45 # SZS output start CNFRefutation
% See solution above
% 0.17/0.45 # Parsed axioms : 8
% 0.17/0.45 # Removed by relevancy pruning/SinE : 0
% 0.17/0.45 # Initial clauses : 15
% 0.17/0.45 # Removed in clause preprocessing : 0
% 0.17/0.45 # Initial clauses in saturation : 15
% 0.17/0.45 # Processed clauses : 72
% 0.17/0.45 # ...of these trivial : 2
% 0.17/0.45 # ...subsumed : 21
% 0.17/0.45 # ...remaining for further processing : 49
% 0.17/0.45 # Other redundant clauses eliminated : 3
% 0.17/0.45 # Clauses deleted for lack of memory : 0
% 0.17/0.45 # Backward-subsumed : 0
% 0.17/0.45 # Backward-rewritten : 0
% 0.17/0.45 # Generated clauses : 154
% 0.17/0.45 # ...of the previous two non-redundant : 118
% 0.17/0.45 # ...aggressively subsumed : 0
% 0.17/0.45 # Contextual simplify-reflections : 1
% 0.17/0.45 # Paramodulations : 147
% 0.17/0.45 # Factorizations : 4
% 0.17/0.45 # NegExts : 0
% 0.17/0.45 # Equation resolutions : 3
% 0.17/0.45 # Total rewrite steps : 10
% 0.17/0.45 # Propositional unsat checks : 0
% 0.17/0.45 # Propositional check models : 0
% 0.17/0.45 # Propositional check unsatisfiable : 0
% 0.17/0.45 # Propositional clauses : 0
% 0.17/0.45 # Propositional clauses after purity: 0
% 0.17/0.45 # Propositional unsat core size : 0
% 0.17/0.45 # Propositional preprocessing time : 0.000
% 0.17/0.45 # Propositional encoding time : 0.000
% 0.17/0.45 # Propositional solver time : 0.000
% 0.17/0.45 # Success case prop preproc time : 0.000
% 0.17/0.45 # Success case prop encoding time : 0.000
% 0.17/0.45 # Success case prop solver time : 0.000
% 0.17/0.45 # Current number of processed clauses : 31
% 0.17/0.45 # Positive orientable unit clauses : 5
% 0.17/0.45 # Positive unorientable unit clauses: 1
% 0.17/0.45 # Negative unit clauses : 4
% 0.17/0.45 # Non-unit-clauses : 21
% 0.17/0.45 # Current number of unprocessed clauses: 76
% 0.17/0.45 # ...number of literals in the above : 203
% 0.17/0.45 # Current number of archived formulas : 0
% 0.17/0.45 # Current number of archived clauses : 15
% 0.17/0.45 # Clause-clause subsumption calls (NU) : 203
% 0.17/0.45 # Rec. Clause-clause subsumption calls : 177
% 0.17/0.45 # Non-unit clause-clause subsumptions : 22
% 0.17/0.45 # Unit Clause-clause subsumption calls : 5
% 0.17/0.45 # Rewrite failures with RHS unbound : 0
% 0.17/0.45 # BW rewrite match attempts : 10
% 0.17/0.45 # BW rewrite match successes : 10
% 0.17/0.45 # Condensation attempts : 0
% 0.17/0.45 # Condensation successes : 0
% 0.17/0.45 # Termbank termtop insertions : 2688
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.004 s
% 0.17/0.45 # System time : 0.005 s
% 0.17/0.45 # Total time : 0.008 s
% 0.17/0.45 # Maximum resident set size: 1740 pages
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.024 s
% 0.17/0.45 # System time : 0.009 s
% 0.17/0.45 # Total time : 0.033 s
% 0.17/0.45 # Maximum resident set size: 1680 pages
% 0.17/0.45 % E---3.1 exiting
% 0.17/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------