TSTP Solution File: SET639+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET639+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:13 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 : 14 ( 8 unt; 0 def)
% Number of atoms : 23 ( 15 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 14 ( 5 ~; 2 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn; 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_th121,conjecture,
! [X1,X2] :
( ( subset(X1,X2)
& intersection(X2,X1) = empty_set )
=> X1 = empty_set ),
file('/export/starexec/sandbox/tmp/tmp.WgX2TXrsVN/E---3.1_28215.p',prove_th121) ).
fof(commutativity_of_intersection,axiom,
! [X1,X2] : intersection(X1,X2) = intersection(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.WgX2TXrsVN/E---3.1_28215.p',commutativity_of_intersection) ).
fof(subset_intersection,axiom,
! [X1,X2] :
( subset(X1,X2)
=> intersection(X1,X2) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.WgX2TXrsVN/E---3.1_28215.p',subset_intersection) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] :
( ( subset(X1,X2)
& intersection(X2,X1) = empty_set )
=> X1 = empty_set ),
inference(assume_negation,[status(cth)],[prove_th121]) ).
fof(c_0_4,negated_conjecture,
( subset(esk1_0,esk2_0)
& intersection(esk2_0,esk1_0) = empty_set
& esk1_0 != empty_set ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_5,plain,
! [X12,X13] : intersection(X12,X13) = intersection(X13,X12),
inference(variable_rename,[status(thm)],[commutativity_of_intersection]) ).
cnf(c_0_6,negated_conjecture,
intersection(esk2_0,esk1_0) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
intersection(X1,X2) = intersection(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X7,X8] :
( ~ subset(X7,X8)
| intersection(X7,X8) = X7 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[subset_intersection])]) ).
cnf(c_0_9,negated_conjecture,
intersection(esk1_0,esk2_0) = empty_set,
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
( intersection(X1,X2) = X1
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,negated_conjecture,
esk1_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : SET639+3 : TPTP v8.1.2. Released v2.2.0.
% 0.02/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n009.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 2400
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon Oct 2 16:28:14 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 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.WgX2TXrsVN/E---3.1_28215.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 # new_bool_1 with pid 28294 completed with status 0
% 0.17/0.45 # Result found by new_bool_1
% 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 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.45 # Search class: FGUSS-FFSF22-SFFFFFNN
% 0.17/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.17/0.45 # U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 28298 completed with status 0
% 0.17/0.45 # Result found by U----_206c_00_C07_23_F1_SE_PI_CS_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 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.45 # Search class: FGUSS-FFSF22-SFFFFFNN
% 0.17/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 181s (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 : 10
% 0.17/0.45 # Removed by relevancy pruning/SinE : 1
% 0.17/0.45 # Initial clauses : 20
% 0.17/0.45 # Removed in clause preprocessing : 2
% 0.17/0.45 # Initial clauses in saturation : 18
% 0.17/0.45 # Processed clauses : 26
% 0.17/0.45 # ...of these trivial : 0
% 0.17/0.45 # ...subsumed : 0
% 0.17/0.45 # ...remaining for further processing : 26
% 0.17/0.45 # Other redundant clauses eliminated : 2
% 0.17/0.45 # Clauses deleted for lack of memory : 0
% 0.17/0.45 # Backward-subsumed : 0
% 0.17/0.45 # Backward-rewritten : 1
% 0.17/0.45 # Generated clauses : 5
% 0.17/0.45 # ...of the previous two non-redundant : 1
% 0.17/0.45 # ...aggressively subsumed : 0
% 0.17/0.45 # Contextual simplify-reflections : 0
% 0.17/0.45 # Paramodulations : 3
% 0.17/0.45 # Factorizations : 0
% 0.17/0.45 # NegExts : 0
% 0.17/0.45 # Equation resolutions : 2
% 0.17/0.45 # Total rewrite steps : 4
% 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 : 7
% 0.17/0.45 # Positive orientable unit clauses : 3
% 0.17/0.45 # Positive unorientable unit clauses: 1
% 0.17/0.45 # Negative unit clauses : 2
% 0.17/0.45 # Non-unit-clauses : 1
% 0.17/0.45 # Current number of unprocessed clauses: 9
% 0.17/0.45 # ...number of literals in the above : 23
% 0.17/0.45 # Current number of archived formulas : 0
% 0.17/0.45 # Current number of archived clauses : 17
% 0.17/0.45 # Clause-clause subsumption calls (NU) : 4
% 0.17/0.45 # Rec. Clause-clause subsumption calls : 4
% 0.17/0.45 # Non-unit clause-clause subsumptions : 0
% 0.17/0.45 # Unit Clause-clause subsumption calls : 0
% 0.17/0.45 # Rewrite failures with RHS unbound : 0
% 0.17/0.45 # BW rewrite match attempts : 4
% 0.17/0.45 # BW rewrite match successes : 4
% 0.17/0.45 # Condensation attempts : 0
% 0.17/0.45 # Condensation successes : 0
% 0.17/0.45 # Termbank termtop insertions : 947
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.005 s
% 0.17/0.45 # System time : 0.000 s
% 0.17/0.45 # Total time : 0.005 s
% 0.17/0.45 # Maximum resident set size: 1748 pages
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.005 s
% 0.17/0.45 # System time : 0.002 s
% 0.17/0.45 # Total time : 0.007 s
% 0.17/0.45 # Maximum resident set size: 1680 pages
% 0.17/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------