TSTP Solution File: SET971+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET971+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:26 EDT 2023
% Result : Theorem 0.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 13 unt; 0 def)
% Number of atoms : 28 ( 16 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 14 ( 5 ~; 2 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn; 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t124_zfmisc_1,conjecture,
! [X1,X2,X3,X4] :
( ( subset(X1,X2)
& subset(X3,X4) )
=> set_intersection2(cartesian_product2(X1,X4),cartesian_product2(X2,X3)) = cartesian_product2(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.SNlflwuQPQ/E---3.1_8391.p',t124_zfmisc_1) ).
fof(t28_xboole_1,axiom,
! [X1,X2] :
( subset(X1,X2)
=> set_intersection2(X1,X2) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.SNlflwuQPQ/E---3.1_8391.p',t28_xboole_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.SNlflwuQPQ/E---3.1_8391.p',t123_zfmisc_1) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.SNlflwuQPQ/E---3.1_8391.p',commutativity_k3_xboole_0) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ( subset(X1,X2)
& subset(X3,X4) )
=> set_intersection2(cartesian_product2(X1,X4),cartesian_product2(X2,X3)) = cartesian_product2(X1,X3) ),
inference(assume_negation,[status(cth)],[t124_zfmisc_1]) ).
fof(c_0_5,plain,
! [X17,X18] :
( ~ subset(X17,X18)
| set_intersection2(X17,X18) = X17 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t28_xboole_1])]) ).
fof(c_0_6,negated_conjecture,
( subset(esk1_0,esk2_0)
& subset(esk3_0,esk4_0)
& set_intersection2(cartesian_product2(esk1_0,esk4_0),cartesian_product2(esk2_0,esk3_0)) != cartesian_product2(esk1_0,esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_7,plain,
! [X9,X10,X11,X12] : cartesian_product2(set_intersection2(X9,X10),set_intersection2(X11,X12)) = set_intersection2(cartesian_product2(X9,X11),cartesian_product2(X10,X12)),
inference(variable_rename,[status(thm)],[t123_zfmisc_1]) ).
cnf(c_0_8,plain,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,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_7]) ).
cnf(c_0_11,negated_conjecture,
set_intersection2(esk1_0,esk2_0) = esk1_0,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
fof(c_0_12,plain,
! [X13,X14] : set_intersection2(X13,X14) = set_intersection2(X14,X13),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_13,negated_conjecture,
subset(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,negated_conjecture,
set_intersection2(cartesian_product2(esk1_0,esk4_0),cartesian_product2(esk2_0,esk3_0)) != cartesian_product2(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
set_intersection2(cartesian_product2(esk1_0,X1),cartesian_product2(esk2_0,X2)) = cartesian_product2(esk1_0,set_intersection2(X1,X2)),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
set_intersection2(esk3_0,esk4_0) = esk3_0,
inference(spm,[status(thm)],[c_0_8,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : SET971+1 : TPTP v8.1.2. Released v3.2.0.
% 0.05/0.12 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n014.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 2400
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Mon Oct 2 16:52:49 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 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 --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.SNlflwuQPQ/E---3.1_8391.p
% 0.16/0.44 # Version: 3.1pre001
% 0.16/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN 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 # new_bool_3 with pid 8471 completed with status 0
% 0.16/0.44 # Result found by new_bool_3
% 0.16/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.44 # Search class: FHUSM-FFSF22-SFFFFFNN
% 0.16/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 0.16/0.44 # G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with pid 8474 completed with status 0
% 0.16/0.44 # Result found by G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S
% 0.16/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.44 # Search class: FHUSM-FFSF22-SFFFFFNN
% 0.16/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with 181s (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 : 8
% 0.16/0.44 # Removed by relevancy pruning/SinE : 2
% 0.16/0.44 # Initial clauses : 8
% 0.16/0.44 # Removed in clause preprocessing : 0
% 0.16/0.44 # Initial clauses in saturation : 8
% 0.16/0.44 # Processed clauses : 24
% 0.16/0.44 # ...of these trivial : 0
% 0.16/0.44 # ...subsumed : 0
% 0.16/0.44 # ...remaining for further processing : 24
% 0.16/0.44 # Other redundant clauses eliminated : 0
% 0.16/0.44 # Clauses deleted for lack of memory : 0
% 0.16/0.44 # Backward-subsumed : 0
% 0.16/0.44 # Backward-rewritten : 1
% 0.16/0.44 # Generated clauses : 54
% 0.16/0.44 # ...of the previous two non-redundant : 36
% 0.16/0.44 # ...aggressively subsumed : 0
% 0.16/0.44 # Contextual simplify-reflections : 0
% 0.16/0.44 # Paramodulations : 54
% 0.16/0.44 # Factorizations : 0
% 0.16/0.44 # NegExts : 0
% 0.16/0.44 # Equation resolutions : 0
% 0.16/0.44 # Total rewrite steps : 32
% 0.16/0.44 # 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 : 15
% 0.16/0.45 # Positive orientable unit clauses : 13
% 0.16/0.45 # Positive unorientable unit clauses: 1
% 0.16/0.45 # Negative unit clauses : 0
% 0.16/0.45 # Non-unit-clauses : 1
% 0.16/0.45 # Current number of unprocessed clauses: 28
% 0.16/0.45 # ...number of literals in the above : 28
% 0.16/0.45 # Current number of archived formulas : 0
% 0.16/0.45 # Current number of archived clauses : 9
% 0.16/0.45 # Clause-clause subsumption calls (NU) : 0
% 0.16/0.45 # Rec. Clause-clause subsumption calls : 0
% 0.16/0.45 # Non-unit clause-clause subsumptions : 0
% 0.16/0.45 # Unit Clause-clause subsumption calls : 0
% 0.16/0.45 # Rewrite failures with RHS unbound : 0
% 0.16/0.45 # BW rewrite match attempts : 18
% 0.16/0.45 # BW rewrite match successes : 5
% 0.16/0.45 # Condensation attempts : 0
% 0.16/0.45 # Condensation successes : 0
% 0.16/0.45 # Termbank termtop insertions : 931
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.004 s
% 0.16/0.45 # System time : 0.001 s
% 0.16/0.45 # Total time : 0.004 s
% 0.16/0.45 # Maximum resident set size: 1608 pages
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.005 s
% 0.16/0.45 # System time : 0.002 s
% 0.16/0.45 # Total time : 0.007 s
% 0.16/0.45 # Maximum resident set size: 1684 pages
% 0.16/0.45 % E---3.1 exiting
% 0.16/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------