TSTP Solution File: SET619+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET619+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:23:09 EDT 2023
% Result : Theorem 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 29 ( 29 unt; 0 def)
% Number of atoms : 29 ( 28 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 53 ( 2 sgn; 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_th95,conjecture,
! [X1,X2] : union(X1,X2) = union(symmetric_difference(X1,X2),intersection(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.HGLlUVM96v/E---3.1_20863.p',prove_th95) ).
fof(symmetric_difference_defn,axiom,
! [X1,X2] : symmetric_difference(X1,X2) = union(difference(X1,X2),difference(X2,X1)),
file('/export/starexec/sandbox/tmp/tmp.HGLlUVM96v/E---3.1_20863.p',symmetric_difference_defn) ).
fof(associativity_of_union,axiom,
! [X1,X2,X3] : union(union(X1,X2),X3) = union(X1,union(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.HGLlUVM96v/E---3.1_20863.p',associativity_of_union) ).
fof(union_intersection,axiom,
! [X1,X2] : union(X1,intersection(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.HGLlUVM96v/E---3.1_20863.p',union_intersection) ).
fof(union_intersection_difference,axiom,
! [X1,X2] : union(intersection(X1,X2),difference(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.HGLlUVM96v/E---3.1_20863.p',union_intersection_difference) ).
fof(commutativity_of_intersection,axiom,
! [X1,X2] : intersection(X1,X2) = intersection(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.HGLlUVM96v/E---3.1_20863.p',commutativity_of_intersection) ).
fof(commutativity_of_union,axiom,
! [X1,X2] : union(X1,X2) = union(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.HGLlUVM96v/E---3.1_20863.p',commutativity_of_union) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2] : union(X1,X2) = union(symmetric_difference(X1,X2),intersection(X1,X2)),
inference(assume_negation,[status(cth)],[prove_th95]) ).
fof(c_0_8,negated_conjecture,
union(esk3_0,esk4_0) != union(symmetric_difference(esk3_0,esk4_0),intersection(esk3_0,esk4_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_9,plain,
! [X4,X5] : symmetric_difference(X4,X5) = union(difference(X4,X5),difference(X5,X4)),
inference(variable_rename,[status(thm)],[symmetric_difference_defn]) ).
fof(c_0_10,plain,
! [X6,X7,X8] : union(union(X6,X7),X8) = union(X6,union(X7,X8)),
inference(variable_rename,[status(thm)],[associativity_of_union]) ).
fof(c_0_11,plain,
! [X9,X10] : union(X9,intersection(X9,X10)) = X9,
inference(variable_rename,[status(thm)],[union_intersection]) ).
fof(c_0_12,plain,
! [X11,X12] : union(intersection(X11,X12),difference(X11,X12)) = X11,
inference(variable_rename,[status(thm)],[union_intersection_difference]) ).
fof(c_0_13,plain,
! [X23,X24] : intersection(X23,X24) = intersection(X24,X23),
inference(variable_rename,[status(thm)],[commutativity_of_intersection]) ).
cnf(c_0_14,negated_conjecture,
union(esk3_0,esk4_0) != union(symmetric_difference(esk3_0,esk4_0),intersection(esk3_0,esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
symmetric_difference(X1,X2) = union(difference(X1,X2),difference(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_16,plain,
! [X21,X22] : union(X21,X22) = union(X22,X21),
inference(variable_rename,[status(thm)],[commutativity_of_union]) ).
cnf(c_0_17,plain,
union(union(X1,X2),X3) = union(X1,union(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
union(X1,intersection(X1,X2)) = X1,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
union(intersection(X1,X2),difference(X1,X2)) = X1,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
intersection(X1,X2) = intersection(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
union(esk3_0,esk4_0) != union(union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0)),intersection(esk3_0,esk4_0)),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,plain,
union(X1,X2) = union(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
union(X1,union(intersection(X1,X2),X3)) = union(X1,X3),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
union(intersection(X1,X2),difference(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
union(intersection(esk3_0,esk4_0),union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0))) != union(esk3_0,esk4_0),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
union(intersection(X1,X2),union(difference(X1,X2),X3)) = union(X1,X3),
inference(spm,[status(thm)],[c_0_17,c_0_19]) ).
cnf(c_0_27,plain,
union(X1,difference(X2,X1)) = union(X1,X2),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET619+3 : TPTP v8.1.2. Released v2.2.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n026.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Oct 2 17:44:29 EDT 2023
% 0.14/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/tmp/tmp.HGLlUVM96v/E---3.1_20863.p
% 0.20/0.51 # Version: 3.1pre001
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 21033 completed with status 0
% 0.20/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FGUSM-FFMF22-MFFFFFNN
% 0.20/0.51 # partial match(1): FGUSM-FFMF21-MFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 811s (1) cores
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.51 # Starting sh5l with 136s (1) cores
% 0.20/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 21040 completed with status 0
% 0.20/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FGUSM-FFMF22-MFFFFFNN
% 0.20/0.51 # partial match(1): FGUSM-FFMF21-MFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 811s (1) cores
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.51 # Preprocessing time : 0.001 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Theorem
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 14
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 25
% 0.20/0.51 # Removed in clause preprocessing : 3
% 0.20/0.51 # Initial clauses in saturation : 22
% 0.20/0.51 # Processed clauses : 105
% 0.20/0.51 # ...of these trivial : 18
% 0.20/0.51 # ...subsumed : 20
% 0.20/0.51 # ...remaining for further processing : 67
% 0.20/0.51 # Other redundant clauses eliminated : 2
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 0
% 0.20/0.51 # Backward-rewritten : 2
% 0.20/0.51 # Generated clauses : 420
% 0.20/0.51 # ...of the previous two non-redundant : 309
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 0
% 0.20/0.51 # Paramodulations : 416
% 0.20/0.51 # Factorizations : 2
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 2
% 0.20/0.51 # Total rewrite steps : 187
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 44
% 0.20/0.51 # Positive orientable unit clauses : 22
% 0.20/0.51 # Positive unorientable unit clauses: 3
% 0.20/0.51 # Negative unit clauses : 0
% 0.20/0.51 # Non-unit-clauses : 19
% 0.20/0.51 # Current number of unprocessed clauses: 245
% 0.20/0.51 # ...number of literals in the above : 392
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 22
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 174
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 152
% 0.20/0.51 # Non-unit clause-clause subsumptions : 14
% 0.20/0.51 # Unit Clause-clause subsumption calls : 2
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 59
% 0.20/0.51 # BW rewrite match successes : 41
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 4233
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.010 s
% 0.20/0.51 # System time : 0.004 s
% 0.20/0.51 # Total time : 0.014 s
% 0.20/0.51 # Maximum resident set size: 1800 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.059 s
% 0.20/0.51 # System time : 0.011 s
% 0.20/0.51 # Total time : 0.070 s
% 0.20/0.51 # Maximum resident set size: 1680 pages
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------