TSTP Solution File: SET635+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET635+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:20:03 EDT 2023
% Result : Theorem 0.14s 0.42s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 33 ( 30 unt; 0 def)
% Number of atoms : 38 ( 30 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 12 ( 7 ~; 3 |; 1 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 61 ( 0 sgn; 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(difference_and_intersection,axiom,
! [X1,X2,X3] : intersection(X1,difference(X2,X3)) = difference(intersection(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.aDjNbZL8kc/E---3.1_18822.p',difference_and_intersection) ).
fof(commutativity_of_intersection,axiom,
! [X1,X2] : intersection(X1,X2) = intersection(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.aDjNbZL8kc/E---3.1_18822.p',commutativity_of_intersection) ).
fof(difference_empty_set,axiom,
! [X1,X2] :
( difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.aDjNbZL8kc/E---3.1_18822.p',difference_empty_set) ).
fof(reflexivity_of_subset,axiom,
! [X1] : subset(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.aDjNbZL8kc/E---3.1_18822.p',reflexivity_of_subset) ).
fof(union_empty_set,axiom,
! [X1] : union(X1,empty_set) = X1,
file('/export/starexec/sandbox/tmp/tmp.aDjNbZL8kc/E---3.1_18822.p',union_empty_set) ).
fof(commutativity_of_union,axiom,
! [X1,X2] : union(X1,X2) = union(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.aDjNbZL8kc/E---3.1_18822.p',commutativity_of_union) ).
fof(prove_th117,conjecture,
! [X1,X2,X3] : intersection(X1,difference(X2,X3)) = difference(intersection(X1,X2),intersection(X1,X3)),
file('/export/starexec/sandbox/tmp/tmp.aDjNbZL8kc/E---3.1_18822.p',prove_th117) ).
fof(difference_and_intersection_and_union,axiom,
! [X1,X2,X3] : difference(X1,intersection(X2,X3)) = union(difference(X1,X2),difference(X1,X3)),
file('/export/starexec/sandbox/tmp/tmp.aDjNbZL8kc/E---3.1_18822.p',difference_and_intersection_and_union) ).
fof(c_0_8,plain,
! [X12,X13,X14] : intersection(X12,difference(X13,X14)) = difference(intersection(X12,X13),X14),
inference(variable_rename,[status(thm)],[difference_and_intersection]) ).
fof(c_0_9,plain,
! [X23,X24] : intersection(X23,X24) = intersection(X24,X23),
inference(variable_rename,[status(thm)],[commutativity_of_intersection]) ).
fof(c_0_10,plain,
! [X7,X8] :
( ( difference(X7,X8) != empty_set
| subset(X7,X8) )
& ( ~ subset(X7,X8)
| difference(X7,X8) = empty_set ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[difference_empty_set])]) ).
fof(c_0_11,plain,
! [X33] : subset(X33,X33),
inference(variable_rename,[status(thm)],[reflexivity_of_subset]) ).
fof(c_0_12,plain,
! [X34] : union(X34,empty_set) = X34,
inference(variable_rename,[status(thm)],[union_empty_set]) ).
fof(c_0_13,plain,
! [X36,X37] : union(X36,X37) = union(X37,X36),
inference(variable_rename,[status(thm)],[commutativity_of_union]) ).
fof(c_0_14,negated_conjecture,
~ ! [X1,X2,X3] : intersection(X1,difference(X2,X3)) = difference(intersection(X1,X2),intersection(X1,X3)),
inference(assume_negation,[status(cth)],[prove_th117]) ).
cnf(c_0_15,plain,
intersection(X1,difference(X2,X3)) = difference(intersection(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
intersection(X1,X2) = intersection(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_17,plain,
! [X9,X10,X11] : difference(X9,intersection(X10,X11)) = union(difference(X9,X10),difference(X9,X11)),
inference(variable_rename,[status(thm)],[difference_and_intersection_and_union]) ).
cnf(c_0_18,plain,
( difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
union(X1,empty_set) = X1,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
union(X1,X2) = union(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_22,negated_conjecture,
intersection(esk1_0,difference(esk2_0,esk3_0)) != difference(intersection(esk1_0,esk2_0),intersection(esk1_0,esk3_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
cnf(c_0_23,plain,
intersection(X1,difference(X2,X3)) = intersection(X2,difference(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_15]) ).
cnf(c_0_24,plain,
difference(X1,intersection(X2,X3)) = union(difference(X1,X2),difference(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
difference(X1,X1) = empty_set,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,plain,
union(empty_set,X1) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
intersection(esk1_0,difference(esk2_0,esk3_0)) != difference(intersection(esk1_0,esk2_0),intersection(esk1_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
intersection(difference(X1,X2),X3) = intersection(X1,difference(X3,X2)),
inference(spm,[status(thm)],[c_0_16,c_0_23]) ).
cnf(c_0_29,plain,
difference(X1,intersection(X1,X2)) = difference(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_30,negated_conjecture,
intersection(esk1_0,difference(esk2_0,intersection(esk1_0,esk3_0))) != intersection(esk1_0,difference(esk2_0,esk3_0)),
inference(rw,[status(thm)],[c_0_27,c_0_15]) ).
cnf(c_0_31,plain,
intersection(X1,difference(X2,intersection(X1,X3))) = intersection(X1,difference(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_28]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SET635+3 : TPTP v8.1.2. Released v2.2.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n023.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Oct 2 17:25:22 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.aDjNbZL8kc/E---3.1_18822.p
% 0.14/0.42 # Version: 3.1pre001
% 0.14/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.42 # Starting sh5l with 300s (1) cores
% 0.14/0.42 # sh5l with pid 18903 completed with status 0
% 0.14/0.42 # Result found by sh5l
% 0.14/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.42 # Starting sh5l with 300s (1) cores
% 0.14/0.42 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.42 # Search class: FGHSM-FFMF22-SFFFFFNN
% 0.14/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.42 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 181s (1) cores
% 0.14/0.42 # G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with pid 18907 completed with status 0
% 0.14/0.42 # Result found by G-E--_300_C18_F1_SE_CS_SP_PS_S0Y
% 0.14/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.42 # Starting sh5l with 300s (1) cores
% 0.14/0.42 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.42 # Search class: FGHSM-FFMF22-SFFFFFNN
% 0.14/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.42 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 181s (1) cores
% 0.14/0.42 # Preprocessing time : 0.001 s
% 0.14/0.42 # Presaturation interreduction done
% 0.14/0.42
% 0.14/0.42 # Proof found!
% 0.14/0.42 # SZS status Theorem
% 0.14/0.42 # SZS output start CNFRefutation
% See solution above
% 0.14/0.42 # Parsed axioms : 16
% 0.14/0.42 # Removed by relevancy pruning/SinE : 1
% 0.14/0.42 # Initial clauses : 27
% 0.14/0.42 # Removed in clause preprocessing : 2
% 0.14/0.42 # Initial clauses in saturation : 25
% 0.14/0.42 # Processed clauses : 119
% 0.14/0.42 # ...of these trivial : 26
% 0.14/0.42 # ...subsumed : 19
% 0.14/0.42 # ...remaining for further processing : 74
% 0.14/0.42 # Other redundant clauses eliminated : 2
% 0.14/0.42 # Clauses deleted for lack of memory : 0
% 0.14/0.42 # Backward-subsumed : 0
% 0.14/0.42 # Backward-rewritten : 4
% 0.14/0.42 # Generated clauses : 445
% 0.14/0.42 # ...of the previous two non-redundant : 272
% 0.14/0.42 # ...aggressively subsumed : 0
% 0.14/0.42 # Contextual simplify-reflections : 0
% 0.14/0.42 # Paramodulations : 441
% 0.14/0.42 # Factorizations : 2
% 0.14/0.42 # NegExts : 0
% 0.14/0.42 # Equation resolutions : 2
% 0.14/0.42 # Total rewrite steps : 345
% 0.14/0.42 # Propositional unsat checks : 0
% 0.14/0.42 # Propositional check models : 0
% 0.14/0.42 # Propositional check unsatisfiable : 0
% 0.14/0.42 # Propositional clauses : 0
% 0.14/0.42 # Propositional clauses after purity: 0
% 0.14/0.42 # Propositional unsat core size : 0
% 0.14/0.42 # Propositional preprocessing time : 0.000
% 0.14/0.42 # Propositional encoding time : 0.000
% 0.14/0.42 # Propositional solver time : 0.000
% 0.14/0.42 # Success case prop preproc time : 0.000
% 0.14/0.42 # Success case prop encoding time : 0.000
% 0.14/0.42 # Success case prop solver time : 0.000
% 0.14/0.42 # Current number of processed clauses : 45
% 0.14/0.42 # Positive orientable unit clauses : 26
% 0.14/0.42 # Positive unorientable unit clauses: 3
% 0.14/0.42 # Negative unit clauses : 1
% 0.14/0.42 # Non-unit-clauses : 15
% 0.14/0.42 # Current number of unprocessed clauses: 199
% 0.14/0.42 # ...number of literals in the above : 298
% 0.14/0.42 # Current number of archived formulas : 0
% 0.14/0.42 # Current number of archived clauses : 27
% 0.14/0.42 # Clause-clause subsumption calls (NU) : 62
% 0.14/0.42 # Rec. Clause-clause subsumption calls : 57
% 0.14/0.42 # Non-unit clause-clause subsumptions : 0
% 0.14/0.42 # Unit Clause-clause subsumption calls : 4
% 0.14/0.42 # Rewrite failures with RHS unbound : 0
% 0.14/0.42 # BW rewrite match attempts : 53
% 0.14/0.42 # BW rewrite match successes : 28
% 0.14/0.42 # Condensation attempts : 0
% 0.14/0.42 # Condensation successes : 0
% 0.14/0.42 # Termbank termtop insertions : 4560
% 0.14/0.42
% 0.14/0.42 # -------------------------------------------------
% 0.14/0.42 # User time : 0.008 s
% 0.14/0.42 # System time : 0.002 s
% 0.14/0.42 # Total time : 0.011 s
% 0.14/0.42 # Maximum resident set size: 1720 pages
% 0.14/0.42
% 0.14/0.42 # -------------------------------------------------
% 0.14/0.42 # User time : 0.009 s
% 0.14/0.42 # System time : 0.005 s
% 0.14/0.42 # Total time : 0.013 s
% 0.14/0.42 # Maximum resident set size: 1684 pages
% 0.14/0.42 % E---3.1 exiting
% 0.14/0.42 % E---3.1 exiting
%------------------------------------------------------------------------------