TSTP Solution File: SET241-6 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : SET241-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n019.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:18:57 EDT 2023

% Result   : Unsatisfiable 0.17s 0.47s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   13 (   8 unt;   0 nHn;  11 RR)
%            Number of literals    :   18 (   2 equ;   7 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-3 aty)
%            Number of variables   :   24 (   7 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(intersection2,axiom,
    ( member(X1,X3)
    | ~ member(X1,intersection(X2,X3)) ),
    file('/export/starexec/sandbox2/tmp/tmp.qbuDAXBeZF/E---3.1_682.p',intersection2) ).

cnf(restriction1,axiom,
    intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
    file('/export/starexec/sandbox2/tmp/tmp.qbuDAXBeZF/E---3.1_682.p',restriction1) ).

cnf(prove_restriction_alternate_defn4_1,negated_conjecture,
    member(ordered_pair(u,v),restrict(xr,x,y)),
    file('/export/starexec/sandbox2/tmp/tmp.qbuDAXBeZF/E---3.1_682.p',prove_restriction_alternate_defn4_1) ).

cnf(cartesian_product2,axiom,
    ( member(X2,X4)
    | ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
    file('/export/starexec/sandbox2/tmp/tmp.qbuDAXBeZF/E---3.1_682.p',cartesian_product2) ).

cnf(prove_restriction_alternate_defn4_2,negated_conjecture,
    ~ member(v,y),
    file('/export/starexec/sandbox2/tmp/tmp.qbuDAXBeZF/E---3.1_682.p',prove_restriction_alternate_defn4_2) ).

cnf(c_0_5,axiom,
    ( member(X1,X3)
    | ~ member(X1,intersection(X2,X3)) ),
    intersection2 ).

cnf(c_0_6,axiom,
    intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
    restriction1 ).

cnf(c_0_7,plain,
    ( member(X1,cross_product(X2,X3))
    | ~ member(X1,restrict(X4,X2,X3)) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_8,negated_conjecture,
    member(ordered_pair(u,v),restrict(xr,x,y)),
    prove_restriction_alternate_defn4_1 ).

cnf(c_0_9,axiom,
    ( member(X2,X4)
    | ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
    cartesian_product2 ).

cnf(c_0_10,negated_conjecture,
    member(ordered_pair(u,v),cross_product(x,y)),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    ~ member(v,y),
    prove_restriction_alternate_defn4_2 ).

cnf(c_0_12,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13  % Problem    : SET241-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.06/0.14  % Command    : run_E %s %d THM
% 0.13/0.33  % Computer : n019.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 2400
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Mon Oct  2 17:58:21 EDT 2023
% 0.13/0.33  % CPUTime    : 
% 0.17/0.45  Running first-order theorem proving
% 0.17/0.45  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.qbuDAXBeZF/E---3.1_682.p
% 0.17/0.47  # Version: 3.1pre001
% 0.17/0.47  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47  # Starting new_bool_1 with 300s (1) cores
% 0.17/0.47  # Starting sh5l with 300s (1) cores
% 0.17/0.47  # new_bool_3 with pid 770 completed with status 0
% 0.17/0.47  # Result found by new_bool_3
% 0.17/0.47  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.47  # Search class: FGHSM-FFMF31-MFFFFFNN
% 0.17/0.47  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.47  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.17/0.47  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with pid 773 completed with status 0
% 0.17/0.47  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
% 0.17/0.47  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.47  # Search class: FGHSM-FFMF31-MFFFFFNN
% 0.17/0.47  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.47  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.17/0.47  # Preprocessing time       : 0.002 s
% 0.17/0.47  # Presaturation interreduction done
% 0.17/0.47  
% 0.17/0.47  # Proof found!
% 0.17/0.47  # SZS status Unsatisfiable
% 0.17/0.47  # SZS output start CNFRefutation
% See solution above
% 0.17/0.47  # Parsed axioms                        : 114
% 0.17/0.47  # Removed by relevancy pruning/SinE    : 79
% 0.17/0.47  # Initial clauses                      : 35
% 0.17/0.47  # Removed in clause preprocessing      : 0
% 0.17/0.47  # Initial clauses in saturation        : 35
% 0.17/0.47  # Processed clauses                    : 100
% 0.17/0.47  # ...of these trivial                  : 0
% 0.17/0.47  # ...subsumed                          : 5
% 0.17/0.47  # ...remaining for further processing  : 95
% 0.17/0.47  # Other redundant clauses eliminated   : 2
% 0.17/0.47  # Clauses deleted for lack of memory   : 0
% 0.17/0.47  # Backward-subsumed                    : 0
% 0.17/0.47  # Backward-rewritten                   : 0
% 0.17/0.47  # Generated clauses                    : 84
% 0.17/0.47  # ...of the previous two non-redundant : 75
% 0.17/0.47  # ...aggressively subsumed             : 0
% 0.17/0.47  # Contextual simplify-reflections      : 0
% 0.17/0.47  # Paramodulations                      : 82
% 0.17/0.47  # Factorizations                       : 0
% 0.17/0.47  # NegExts                              : 0
% 0.17/0.47  # Equation resolutions                 : 2
% 0.17/0.47  # Total rewrite steps                  : 4
% 0.17/0.47  # Propositional unsat checks           : 0
% 0.17/0.47  #    Propositional check models        : 0
% 0.17/0.47  #    Propositional check unsatisfiable : 0
% 0.17/0.47  #    Propositional clauses             : 0
% 0.17/0.47  #    Propositional clauses after purity: 0
% 0.17/0.47  #    Propositional unsat core size     : 0
% 0.17/0.47  #    Propositional preprocessing time  : 0.000
% 0.17/0.47  #    Propositional encoding time       : 0.000
% 0.17/0.47  #    Propositional solver time         : 0.000
% 0.17/0.47  #    Success case prop preproc time    : 0.000
% 0.17/0.47  #    Success case prop encoding time   : 0.000
% 0.17/0.47  #    Success case prop solver time     : 0.000
% 0.17/0.47  # Current number of processed clauses  : 59
% 0.17/0.47  #    Positive orientable unit clauses  : 11
% 0.17/0.47  #    Positive unorientable unit clauses: 0
% 0.17/0.47  #    Negative unit clauses             : 1
% 0.17/0.47  #    Non-unit-clauses                  : 47
% 0.17/0.47  # Current number of unprocessed clauses: 42
% 0.17/0.47  # ...number of literals in the above   : 115
% 0.17/0.47  # Current number of archived formulas  : 0
% 0.17/0.47  # Current number of archived clauses   : 34
% 0.17/0.47  # Clause-clause subsumption calls (NU) : 438
% 0.17/0.47  # Rec. Clause-clause subsumption calls : 391
% 0.17/0.47  # Non-unit clause-clause subsumptions  : 5
% 0.17/0.47  # Unit Clause-clause subsumption calls : 4
% 0.17/0.47  # Rewrite failures with RHS unbound    : 0
% 0.17/0.47  # BW rewrite match attempts            : 2
% 0.17/0.47  # BW rewrite match successes           : 0
% 0.17/0.47  # Condensation attempts                : 0
% 0.17/0.47  # Condensation successes               : 0
% 0.17/0.47  # Termbank termtop insertions          : 2890
% 0.17/0.47  
% 0.17/0.47  # -------------------------------------------------
% 0.17/0.47  # User time                : 0.005 s
% 0.17/0.47  # System time              : 0.002 s
% 0.17/0.47  # Total time               : 0.007 s
% 0.17/0.47  # Maximum resident set size: 1816 pages
% 0.17/0.47  
% 0.17/0.47  # -------------------------------------------------
% 0.17/0.47  # User time                : 0.006 s
% 0.17/0.47  # System time              : 0.004 s
% 0.17/0.47  # Total time               : 0.010 s
% 0.17/0.47  # Maximum resident set size: 1776 pages
% 0.17/0.47  % E---3.1 exiting
% 0.17/0.47  % E---3.1 exiting
%------------------------------------------------------------------------------