TSTP Solution File: SET626+3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET626+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:19:40 EDT 2024
% Result : Theorem 0.17s 0.44s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 4 unt; 0 def)
% Number of atoms : 52 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 53 ( 22 ~; 19 |; 7 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 45 ( 2 sgn 23 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(intersect_defn,axiom,
! [X1,X2] :
( intersect(X1,X2)
<=> ? [X3] :
( member(X3,X1)
& member(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.yFmeXTIwno/E---3.1_13448.p',intersect_defn) ).
fof(intersection_defn,axiom,
! [X1,X2,X3] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X1)
& member(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.yFmeXTIwno/E---3.1_13448.p',intersection_defn) ).
fof(prove_th102,conjecture,
! [X1,X2,X3] :
( intersect(X1,intersection(X2,X3))
=> intersect(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.yFmeXTIwno/E---3.1_13448.p',prove_th102) ).
fof(symmetry_of_intersect,axiom,
! [X1,X2] :
( intersect(X1,X2)
=> intersect(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.yFmeXTIwno/E---3.1_13448.p',symmetry_of_intersect) ).
fof(c_0_4,plain,
! [X7,X8,X10,X11,X12] :
( ( member(esk4_2(X7,X8),X7)
| ~ intersect(X7,X8) )
& ( member(esk4_2(X7,X8),X8)
| ~ intersect(X7,X8) )
& ( ~ member(X12,X10)
| ~ member(X12,X11)
| intersect(X10,X11) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[intersect_defn])])])])])])]) ).
fof(c_0_5,plain,
! [X15,X16,X17] :
( ( member(X17,X15)
| ~ member(X17,intersection(X15,X16)) )
& ( member(X17,X16)
| ~ member(X17,intersection(X15,X16)) )
& ( ~ member(X17,X15)
| ~ member(X17,X16)
| member(X17,intersection(X15,X16)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection_defn])])])]) ).
cnf(c_0_6,plain,
( intersect(X2,X3)
| ~ member(X1,X2)
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( member(esk4_2(X1,X2),X1)
| ~ intersect(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( member(esk4_2(X1,X2),X2)
| ~ intersect(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1,X2,X3] :
( intersect(X1,intersection(X2,X3))
=> intersect(X1,X2) ),
inference(assume_negation,[status(cth)],[prove_th102]) ).
cnf(c_0_11,plain,
( intersect(X1,X2)
| ~ intersect(X2,X3)
| ~ member(esk4_2(X2,X3),X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_12,plain,
( member(esk4_2(X1,intersection(X2,X3)),X2)
| ~ intersect(X1,intersection(X2,X3)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
fof(c_0_13,negated_conjecture,
( intersect(esk1_0,intersection(esk2_0,esk3_0))
& ~ intersect(esk1_0,esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_14,plain,
! [X13,X14] :
( ~ intersect(X13,X14)
| intersect(X14,X13) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[symmetry_of_intersect])])]) ).
cnf(c_0_15,plain,
( intersect(X1,X2)
| ~ intersect(X2,intersection(X1,X3)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
intersect(esk1_0,intersection(esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( intersect(X2,X1)
| ~ intersect(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
intersect(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
~ intersect(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : SET626+3 : TPTP v8.1.2. Released v2.2.0.
% 0.02/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n027.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri May 3 10:53:05 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/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.yFmeXTIwno/E---3.1_13448.p
% 0.17/0.44 # Version: 3.1.0
% 0.17/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.44 # Starting sh5l with 300s (1) cores
% 0.17/0.44 # new_bool_3 with pid 13527 completed with status 0
% 0.17/0.44 # Result found by new_bool_3
% 0.17/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.44 # Search class: FGUSF-FFSF22-SFFFFFNN
% 0.17/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.44 # SAT001_MinMin_p005000_rr_RG with pid 13531 completed with status 0
% 0.17/0.44 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.44 # Search class: FGUSF-FFSF22-SFFFFFNN
% 0.17/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.44 # Preprocessing time : 0.001 s
% 0.17/0.44 # Presaturation interreduction done
% 0.17/0.44
% 0.17/0.44 # Proof found!
% 0.17/0.44 # SZS status Theorem
% 0.17/0.44 # SZS output start CNFRefutation
% See solution above
% 0.17/0.44 # Parsed axioms : 6
% 0.17/0.44 # Removed by relevancy pruning/SinE : 0
% 0.17/0.44 # Initial clauses : 14
% 0.17/0.44 # Removed in clause preprocessing : 2
% 0.17/0.44 # Initial clauses in saturation : 12
% 0.17/0.44 # Processed clauses : 41
% 0.17/0.44 # ...of these trivial : 0
% 0.17/0.44 # ...subsumed : 7
% 0.17/0.44 # ...remaining for further processing : 34
% 0.17/0.44 # Other redundant clauses eliminated : 0
% 0.17/0.44 # Clauses deleted for lack of memory : 0
% 0.17/0.44 # Backward-subsumed : 0
% 0.17/0.44 # Backward-rewritten : 0
% 0.17/0.44 # Generated clauses : 57
% 0.17/0.44 # ...of the previous two non-redundant : 40
% 0.17/0.44 # ...aggressively subsumed : 0
% 0.17/0.44 # Contextual simplify-reflections : 0
% 0.17/0.44 # Paramodulations : 55
% 0.17/0.44 # Factorizations : 2
% 0.17/0.44 # NegExts : 0
% 0.17/0.44 # Equation resolutions : 0
% 0.17/0.44 # Disequality decompositions : 0
% 0.17/0.44 # Total rewrite steps : 9
% 0.17/0.44 # ...of those cached : 6
% 0.17/0.44 # Propositional unsat checks : 0
% 0.17/0.44 # Propositional check models : 0
% 0.17/0.44 # Propositional check unsatisfiable : 0
% 0.17/0.44 # Propositional clauses : 0
% 0.17/0.44 # Propositional clauses after purity: 0
% 0.17/0.44 # Propositional unsat core size : 0
% 0.17/0.44 # Propositional preprocessing time : 0.000
% 0.17/0.44 # Propositional encoding time : 0.000
% 0.17/0.44 # Propositional solver time : 0.000
% 0.17/0.44 # Success case prop preproc time : 0.000
% 0.17/0.44 # Success case prop encoding time : 0.000
% 0.17/0.44 # Success case prop solver time : 0.000
% 0.17/0.44 # Current number of processed clauses : 22
% 0.17/0.44 # Positive orientable unit clauses : 5
% 0.17/0.44 # Positive unorientable unit clauses: 1
% 0.17/0.44 # Negative unit clauses : 1
% 0.17/0.44 # Non-unit-clauses : 15
% 0.17/0.44 # Current number of unprocessed clauses: 22
% 0.17/0.44 # ...number of literals in the above : 60
% 0.17/0.44 # Current number of archived formulas : 0
% 0.17/0.44 # Current number of archived clauses : 12
% 0.17/0.44 # Clause-clause subsumption calls (NU) : 44
% 0.17/0.44 # Rec. Clause-clause subsumption calls : 44
% 0.17/0.44 # Non-unit clause-clause subsumptions : 7
% 0.17/0.44 # Unit Clause-clause subsumption calls : 0
% 0.17/0.44 # Rewrite failures with RHS unbound : 0
% 0.17/0.44 # BW rewrite match attempts : 4
% 0.17/0.44 # BW rewrite match successes : 4
% 0.17/0.44 # Condensation attempts : 0
% 0.17/0.44 # Condensation successes : 0
% 0.17/0.44 # Termbank termtop insertions : 1425
% 0.17/0.44 # Search garbage collected termcells : 260
% 0.17/0.44
% 0.17/0.44 # -------------------------------------------------
% 0.17/0.44 # User time : 0.004 s
% 0.17/0.44 # System time : 0.001 s
% 0.17/0.44 # Total time : 0.006 s
% 0.17/0.44 # Maximum resident set size: 1708 pages
% 0.17/0.44
% 0.17/0.44 # -------------------------------------------------
% 0.17/0.44 # User time : 0.006 s
% 0.17/0.44 # System time : 0.003 s
% 0.17/0.44 # Total time : 0.008 s
% 0.17/0.44 # Maximum resident set size: 1692 pages
% 0.17/0.44 % E---3.1 exiting
% 0.17/0.45 % E exiting
%------------------------------------------------------------------------------