TSTP Solution File: SET778-1 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : SET778-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n021.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:56 EDT 2023

% Result   : Satisfiable 0.22s 0.51s
% Output   : Saturation 0.22s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named union_axiom1)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_0_12,axiom,
    ( union(X1,X2,X3)
    | member(g(X1,X2,X3),X1)
    | member(g(X1,X2,X3),X2)
    | member(g(X1,X2,X3),X3) ),
    union_axiom1,
    [final] ).

cnf(c_0_14,axiom,
    ( union(X1,X2,X3)
    | ~ member(g(X1,X2,X3),X1)
    | ~ member(g(X1,X2,X3),X3) ),
    union_axiom2,
    [final] ).

cnf(c_0_16,axiom,
    ( union(X1,X2,X3)
    | ~ member(g(X1,X2,X3),X2)
    | ~ member(g(X1,X2,X3),X3) ),
    union_axiom3,
    [final] ).

cnf(c_0_18,axiom,
    ( subset(X1,X2)
    | ~ member(member_of_1_not_of_2(X1,X2),X2) ),
    subsets_axiom2,
    [final] ).

cnf(c_0_19,axiom,
    ( subset(X1,X2)
    | member(member_of_1_not_of_2(X1,X2),X1) ),
    subsets_axiom1,
    [final] ).

cnf(c_0_20,plain,
    ( union(X1,X1,X2)
    | member(g(X1,X1,X2),X1)
    | member(g(X1,X1,X2),X2) ),
    inference(ef,[status(thm)],[c_0_12]),
    [final] ).

cnf(c_0_21,plain,
    ( union(X1,X2,X1)
    | member(g(X1,X2,X1),X2) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_15]),
    [final] ).

cnf(c_0_22,plain,
    ( union(X1,X2,X2)
    | member(g(X1,X2,X2),X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_13]),c_0_13]),
    [final] ).

cnf(c_0_23,axiom,
    ( member(X4,X1)
    | member(X4,X2)
    | ~ union(X1,X2,X3)
    | ~ member(X4,X3) ),
    member_of_union_is_member_of_one_set,
    [final] ).

cnf(c_0_24,axiom,
    ( member(X4,X3)
    | ~ union(X1,X2,X3)
    | ~ member(X4,X1) ),
    member_of_set1_is_member_of_union,
    [final] ).

cnf(c_0_25,axiom,
    ( member(X4,X3)
    | ~ union(X1,X2,X3)
    | ~ member(X4,X2) ),
    member_of_set2_is_member_of_union,
    [final] ).

cnf(c_0_26,axiom,
    ( member(X1,X3)
    | ~ member(X1,X2)
    | ~ subset(X2,X3) ),
    membership_in_subsets,
    [final] ).

cnf(c_0_27,axiom,
    ( equal_sets(X2,X1)
    | ~ subset(X1,X2)
    | ~ subset(X2,X1) ),
    subsets_are_set_equal_sets,
    [final] ).

cnf(c_0_28,axiom,
    ( subset(X1,X2)
    | ~ equal_sets(X1,X2) ),
    set_equal_sets_are_subsets1,
    [final] ).

cnf(c_0_29,axiom,
    ( subset(X2,X1)
    | ~ equal_sets(X1,X2) ),
    set_equal_sets_are_subsets2,
    [final] ).

cnf(c_0_30,plain,
    union(X1,X1,X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_17]),
    [final] ).

cnf(c_0_31,plain,
    subset(X1,X1),
    inference(spm,[status(thm)],[c_0_18,c_0_19]),
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem    : SET778-1 : TPTP v8.1.2. Released v2.5.0.
% 0.13/0.15  % Command    : run_E %s %d THM
% 0.14/0.36  % Computer : n021.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 2400
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Mon Oct  2 17:40:29 EDT 2023
% 0.14/0.36  % CPUTime    : 
% 0.22/0.50  Running first-order model finding
% 0.22/0.50  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.TsrTQ4Umuq/E---3.1_15071.p
% 0.22/0.51  # Version: 3.1pre001
% 0.22/0.51  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51  # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51  # Starting sh5l with 300s (1) cores
% 0.22/0.51  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 15148 completed with status 1
% 0.22/0.51  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.51  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.51  # No SInE strategy applied
% 0.22/0.51  # Search class: FGUNF-FFSF32-SFFFFFNN
% 0.22/0.51  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.51  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.51  # Starting new_bool_3 with 136s (1) cores
% 0.22/0.51  # Starting new_bool_1 with 136s (1) cores
% 0.22/0.51  # Starting sh5l with 136s (1) cores
% 0.22/0.51  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 15155 completed with status 1
% 0.22/0.51  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.51  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.51  # No SInE strategy applied
% 0.22/0.51  # Search class: FGUNF-FFSF32-SFFFFFNN
% 0.22/0.51  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.51  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.51  # Preprocessing time       : 0.001 s
% 0.22/0.51  # Presaturation interreduction done
% 0.22/0.51  
% 0.22/0.51  # No proof found!
% 0.22/0.51  # SZS status Satisfiable
% 0.22/0.51  # SZS output start Saturation
% See solution above
% 0.22/0.52  # Parsed axioms                        : 12
% 0.22/0.52  # Removed by relevancy pruning/SinE    : 0
% 0.22/0.52  # Initial clauses                      : 12
% 0.22/0.52  # Removed in clause preprocessing      : 0
% 0.22/0.52  # Initial clauses in saturation        : 12
% 0.22/0.52  # Processed clauses                    : 38
% 0.22/0.52  # ...of these trivial                  : 2
% 0.22/0.52  # ...subsumed                          : 4
% 0.22/0.52  # ...remaining for further processing  : 32
% 0.22/0.52  # Other redundant clauses eliminated   : 0
% 0.22/0.52  # Clauses deleted for lack of memory   : 0
% 0.22/0.52  # Backward-subsumed                    : 2
% 0.22/0.52  # Backward-rewritten                   : 1
% 0.22/0.52  # Generated clauses                    : 33
% 0.22/0.52  # ...of the previous two non-redundant : 15
% 0.22/0.52  # ...aggressively subsumed             : 0
% 0.22/0.52  # Contextual simplify-reflections      : 3
% 0.22/0.52  # Paramodulations                      : 21
% 0.22/0.52  # Factorizations                       : 12
% 0.22/0.52  # NegExts                              : 0
% 0.22/0.52  # Equation resolutions                 : 0
% 0.22/0.52  # Total rewrite steps                  : 9
% 0.22/0.52  # Propositional unsat checks           : 0
% 0.22/0.52  #    Propositional check models        : 0
% 0.22/0.52  #    Propositional check unsatisfiable : 0
% 0.22/0.52  #    Propositional clauses             : 0
% 0.22/0.52  #    Propositional clauses after purity: 0
% 0.22/0.52  #    Propositional unsat core size     : 0
% 0.22/0.52  #    Propositional preprocessing time  : 0.000
% 0.22/0.52  #    Propositional encoding time       : 0.000
% 0.22/0.52  #    Propositional solver time         : 0.000
% 0.22/0.52  #    Success case prop preproc time    : 0.000
% 0.22/0.52  #    Success case prop encoding time   : 0.000
% 0.22/0.52  #    Success case prop solver time     : 0.000
% 0.22/0.52  # Current number of processed clauses  : 17
% 0.22/0.52  #    Positive orientable unit clauses  : 2
% 0.22/0.52  #    Positive unorientable unit clauses: 0
% 0.22/0.52  #    Negative unit clauses             : 0
% 0.22/0.52  #    Non-unit-clauses                  : 15
% 0.22/0.52  # Current number of unprocessed clauses: 0
% 0.22/0.52  # ...number of literals in the above   : 0
% 0.22/0.52  # Current number of archived formulas  : 0
% 0.22/0.52  # Current number of archived clauses   : 15
% 0.22/0.52  # Clause-clause subsumption calls (NU) : 61
% 0.22/0.52  # Rec. Clause-clause subsumption calls : 43
% 0.22/0.52  # Non-unit clause-clause subsumptions  : 9
% 0.22/0.52  # Unit Clause-clause subsumption calls : 9
% 0.22/0.52  # Rewrite failures with RHS unbound    : 0
% 0.22/0.52  # BW rewrite match attempts            : 8
% 0.22/0.52  # BW rewrite match successes           : 1
% 0.22/0.52  # Condensation attempts                : 0
% 0.22/0.52  # Condensation successes               : 0
% 0.22/0.52  # Termbank termtop insertions          : 756
% 0.22/0.52  
% 0.22/0.52  # -------------------------------------------------
% 0.22/0.52  # User time                : 0.002 s
% 0.22/0.52  # System time              : 0.003 s
% 0.22/0.52  # Total time               : 0.005 s
% 0.22/0.52  # Maximum resident set size: 1644 pages
% 0.22/0.52  
% 0.22/0.52  # -------------------------------------------------
% 0.22/0.52  # User time                : 0.014 s
% 0.22/0.52  # System time              : 0.007 s
% 0.22/0.52  # Total time               : 0.021 s
% 0.22/0.52  # Maximum resident set size: 1680 pages
% 0.22/0.52  % E---3.1 exiting
%------------------------------------------------------------------------------