TSTP Solution File: SET622+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET622+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:19:59 EDT 2023
% Result : Theorem 0.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 25 ( 25 unt; 0 def)
% Number of atoms : 25 ( 24 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn; 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_th98,conjecture,
! [X1,X2,X3] : difference(X1,symmetric_difference(X2,X3)) = union(difference(X1,union(X2,X3)),intersection(intersection(X1,X2),X3)),
file('/export/starexec/sandbox/tmp/tmp.JHn5S6viF3/E---3.1_30186.p',prove_th98) ).
fof(commutativity_of_intersection,axiom,
! [X1,X2] : intersection(X1,X2) = intersection(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.JHn5S6viF3/E---3.1_30186.p',commutativity_of_intersection) ).
fof(commutativity_of_union,axiom,
! [X1,X2] : union(X1,X2) = union(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.JHn5S6viF3/E---3.1_30186.p',commutativity_of_union) ).
fof(associativity_of_intersection,axiom,
! [X1,X2,X3] : intersection(intersection(X1,X2),X3) = intersection(X1,intersection(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.JHn5S6viF3/E---3.1_30186.p',associativity_of_intersection) ).
fof(difference_difference_union2,axiom,
! [X1,X2,X3] : difference(X1,difference(X2,X3)) = union(difference(X1,X2),intersection(X1,X3)),
file('/export/starexec/sandbox/tmp/tmp.JHn5S6viF3/E---3.1_30186.p',difference_difference_union2) ).
fof(symmetric_difference_and_difference,axiom,
! [X1,X2] : symmetric_difference(X1,X2) = difference(union(X1,X2),intersection(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.JHn5S6viF3/E---3.1_30186.p',symmetric_difference_and_difference) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X3] : difference(X1,symmetric_difference(X2,X3)) = union(difference(X1,union(X2,X3)),intersection(intersection(X1,X2),X3)),
inference(assume_negation,[status(cth)],[prove_th98]) ).
fof(c_0_7,negated_conjecture,
difference(esk1_0,symmetric_difference(esk2_0,esk3_0)) != union(difference(esk1_0,union(esk2_0,esk3_0)),intersection(intersection(esk1_0,esk2_0),esk3_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_8,plain,
! [X25,X26] : intersection(X25,X26) = intersection(X26,X25),
inference(variable_rename,[status(thm)],[commutativity_of_intersection]) ).
cnf(c_0_9,negated_conjecture,
difference(esk1_0,symmetric_difference(esk2_0,esk3_0)) != union(difference(esk1_0,union(esk2_0,esk3_0)),intersection(intersection(esk1_0,esk2_0),esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
intersection(X1,X2) = intersection(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X17,X18] : union(X17,X18) = union(X18,X17),
inference(variable_rename,[status(thm)],[commutativity_of_union]) ).
fof(c_0_12,plain,
! [X19,X20,X21] : intersection(intersection(X19,X20),X21) = intersection(X19,intersection(X20,X21)),
inference(variable_rename,[status(thm)],[associativity_of_intersection]) ).
cnf(c_0_13,negated_conjecture,
union(difference(esk1_0,union(esk2_0,esk3_0)),intersection(esk3_0,intersection(esk1_0,esk2_0))) != difference(esk1_0,symmetric_difference(esk2_0,esk3_0)),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
union(X1,X2) = union(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
intersection(intersection(X1,X2),X3) = intersection(X1,intersection(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X7,X8,X9] : difference(X7,difference(X8,X9)) = union(difference(X7,X8),intersection(X7,X9)),
inference(variable_rename,[status(thm)],[difference_difference_union2]) ).
cnf(c_0_17,negated_conjecture,
union(intersection(esk3_0,intersection(esk1_0,esk2_0)),difference(esk1_0,union(esk2_0,esk3_0))) != difference(esk1_0,symmetric_difference(esk2_0,esk3_0)),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
intersection(X1,intersection(X2,X3)) = intersection(X3,intersection(X1,X2)),
inference(spm,[status(thm)],[c_0_10,c_0_15]) ).
cnf(c_0_19,plain,
difference(X1,difference(X2,X3)) = union(difference(X1,X2),intersection(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_20,plain,
! [X10,X11] : symmetric_difference(X10,X11) = difference(union(X10,X11),intersection(X10,X11)),
inference(variable_rename,[status(thm)],[symmetric_difference_and_difference]) ).
cnf(c_0_21,negated_conjecture,
union(intersection(esk1_0,intersection(esk2_0,esk3_0)),difference(esk1_0,union(esk2_0,esk3_0))) != difference(esk1_0,symmetric_difference(esk2_0,esk3_0)),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
union(intersection(X1,X2),difference(X1,X3)) = difference(X1,difference(X3,X2)),
inference(spm,[status(thm)],[c_0_14,c_0_19]) ).
cnf(c_0_23,plain,
symmetric_difference(X1,X2) = difference(union(X1,X2),intersection(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SET622+3 : TPTP v8.1.2. Released v2.2.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n003.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 16:43:18 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.JHn5S6viF3/E---3.1_30186.p
% 0.16/0.44 # Version: 3.1pre001
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN 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 30265 completed with status 0
% 0.16/0.44 # Result found by new_bool_3
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN 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: FGHSM-FFSF22-MFFFFFNN
% 0.16/0.44 # partial match(1): FGHSM-FFMF22-MFFFFFNN
% 0.16/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.44 # SAT001_MinMin_p005000_rr_RG with pid 30268 completed with status 0
% 0.16/0.44 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN 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: FGHSM-FFSF22-MFFFFFNN
% 0.16/0.44 # partial match(1): FGHSM-FFMF22-MFFFFFNN
% 0.16/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting SAT001_MinMin_p005000_rr_RG 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 : 15
% 0.16/0.44 # Removed by relevancy pruning/SinE : 3
% 0.16/0.44 # Initial clauses : 21
% 0.16/0.44 # Removed in clause preprocessing : 2
% 0.16/0.44 # Initial clauses in saturation : 19
% 0.16/0.44 # Processed clauses : 182
% 0.16/0.44 # ...of these trivial : 2
% 0.16/0.44 # ...subsumed : 104
% 0.16/0.44 # ...remaining for further processing : 76
% 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 : 3
% 0.16/0.44 # Generated clauses : 690
% 0.16/0.44 # ...of the previous two non-redundant : 654
% 0.16/0.44 # ...aggressively subsumed : 0
% 0.16/0.44 # Contextual simplify-reflections : 0
% 0.16/0.44 # Paramodulations : 688
% 0.16/0.44 # Factorizations : 2
% 0.16/0.44 # NegExts : 0
% 0.16/0.44 # Equation resolutions : 0
% 0.16/0.44 # Total rewrite steps : 203
% 0.16/0.44 # Propositional unsat checks : 0
% 0.16/0.44 # Propositional check models : 0
% 0.16/0.44 # Propositional check unsatisfiable : 0
% 0.16/0.44 # Propositional clauses : 0
% 0.16/0.44 # Propositional clauses after purity: 0
% 0.16/0.44 # Propositional unsat core size : 0
% 0.16/0.44 # Propositional preprocessing time : 0.000
% 0.16/0.44 # Propositional encoding time : 0.000
% 0.16/0.44 # Propositional solver time : 0.000
% 0.16/0.44 # Success case prop preproc time : 0.000
% 0.16/0.44 # Success case prop encoding time : 0.000
% 0.16/0.44 # Success case prop solver time : 0.000
% 0.16/0.44 # Current number of processed clauses : 54
% 0.16/0.44 # Positive orientable unit clauses : 10
% 0.16/0.44 # Positive unorientable unit clauses: 6
% 0.16/0.44 # Negative unit clauses : 0
% 0.16/0.44 # Non-unit-clauses : 38
% 0.16/0.44 # Current number of unprocessed clauses: 510
% 0.16/0.44 # ...number of literals in the above : 967
% 0.16/0.44 # Current number of archived formulas : 0
% 0.16/0.44 # Current number of archived clauses : 22
% 0.16/0.44 # Clause-clause subsumption calls (NU) : 610
% 0.16/0.44 # Rec. Clause-clause subsumption calls : 588
% 0.16/0.44 # Non-unit clause-clause subsumptions : 79
% 0.16/0.44 # Unit Clause-clause subsumption calls : 7
% 0.16/0.44 # Rewrite failures with RHS unbound : 0
% 0.16/0.44 # BW rewrite match attempts : 42
% 0.16/0.44 # BW rewrite match successes : 41
% 0.16/0.44 # Condensation attempts : 0
% 0.16/0.44 # Condensation successes : 0
% 0.16/0.44 # Termbank termtop insertions : 8471
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.014 s
% 0.16/0.44 # System time : 0.001 s
% 0.16/0.44 # Total time : 0.014 s
% 0.16/0.44 # Maximum resident set size: 1704 pages
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.014 s
% 0.16/0.44 # System time : 0.003 s
% 0.16/0.44 # Total time : 0.017 s
% 0.16/0.44 # Maximum resident set size: 1684 pages
% 0.16/0.44 % E---3.1 exiting
% 0.16/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------