TSTP Solution File: SET122-7 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET122-7 : TPTP v8.1.2. Bugfixed v7.3.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:22:19 EDT 2024
% Result : Unsatisfiable 0.20s 0.54s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 17 ( 8 unt; 6 nHn; 10 RR)
% Number of literals : 26 ( 12 equ; 9 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 20 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cartesian_product2,axiom,
( member(X2,X4)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
file('/export/starexec/sandbox2/tmp/tmp.WTyi6GlHzp/E---3.1_6557.p',cartesian_product2) ).
cnf(existence_of_1st_and_2nd_3,axiom,
( member(ordered_pair(first(X1),second(X1)),cross_product(universal_class,universal_class))
| second(X1) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.WTyi6GlHzp/E---3.1_6557.p',existence_of_1st_and_2nd_3) ).
cnf(existence_of_1st_and_2nd_5,axiom,
( ordered_pair(first(X1),second(X1)) = X1
| second(X1) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.WTyi6GlHzp/E---3.1_6557.p',existence_of_1st_and_2nd_5) ).
cnf(prove_corollary_2_to_OP_determines_components2_1,negated_conjecture,
~ member(y,universal_class),
file('/export/starexec/sandbox2/tmp/tmp.WTyi6GlHzp/E---3.1_6557.p',prove_corollary_2_to_OP_determines_components2_1) ).
cnf(prove_corollary_2_to_OP_determines_components2_2,negated_conjecture,
second(ordered_pair(x,y)) != ordered_pair(x,y),
file('/export/starexec/sandbox2/tmp/tmp.WTyi6GlHzp/E---3.1_6557.p',prove_corollary_2_to_OP_determines_components2_2) ).
cnf(c_0_5,plain,
( member(X2,X4)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
inference(fof_simplification,[status(thm)],[cartesian_product2]) ).
cnf(c_0_6,axiom,
( member(ordered_pair(first(X1),second(X1)),cross_product(universal_class,universal_class))
| second(X1) = X1 ),
existence_of_1st_and_2nd_3 ).
cnf(c_0_7,axiom,
( ordered_pair(first(X1),second(X1)) = X1
| second(X1) = X1 ),
existence_of_1st_and_2nd_5 ).
cnf(c_0_8,negated_conjecture,
~ member(y,universal_class),
inference(fof_simplification,[status(thm)],[prove_corollary_2_to_OP_determines_components2_1]) ).
cnf(c_0_9,plain,
( member(X2,X4)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
c_0_5 ).
cnf(c_0_10,plain,
( second(X1) = X1
| member(X1,cross_product(universal_class,universal_class)) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,negated_conjecture,
second(ordered_pair(x,y)) != ordered_pair(x,y),
inference(fof_simplification,[status(thm)],[prove_corollary_2_to_OP_determines_components2_2]) ).
cnf(c_0_12,negated_conjecture,
~ member(y,universal_class),
c_0_8 ).
cnf(c_0_13,plain,
( second(ordered_pair(X1,X2)) = ordered_pair(X1,X2)
| member(X2,universal_class) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
second(ordered_pair(x,y)) != ordered_pair(x,y),
c_0_11 ).
cnf(c_0_15,negated_conjecture,
second(ordered_pair(X1,y)) = ordered_pair(X1,y),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET122-7 : TPTP v8.1.2. Bugfixed v7.3.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri May 3 10:11:13 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.WTyi6GlHzp/E---3.1_6557.p
% 0.20/0.54 # Version: 3.1.0
% 0.20/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.54 # Starting sh5l with 300s (1) cores
% 0.20/0.54 # sh5l with pid 6696 completed with status 0
% 0.20/0.54 # Result found by sh5l
% 0.20/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.54 # Starting sh5l with 300s (1) cores
% 0.20/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.54 # Search class: FGHSM-FFLM31-MFFFFFNN
% 0.20/0.54 # Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.54 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 109s (1) cores
% 0.20/0.54 # 208_C09_12_F1_SE_CS_SP_PS_S070I with pid 6702 completed with status 0
% 0.20/0.54 # Result found by 208_C09_12_F1_SE_CS_SP_PS_S070I
% 0.20/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.54 # Starting sh5l with 300s (1) cores
% 0.20/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.54 # Search class: FGHSM-FFLM31-MFFFFFNN
% 0.20/0.54 # Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.54 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 109s (1) cores
% 0.20/0.54 # Preprocessing time : 0.002 s
% 0.20/0.54 # Presaturation interreduction done
% 0.20/0.54
% 0.20/0.54 # Proof found!
% 0.20/0.54 # SZS status Unsatisfiable
% 0.20/0.54 # SZS output start CNFRefutation
% See solution above
% 0.20/0.54 # Parsed axioms : 169
% 0.20/0.54 # Removed by relevancy pruning/SinE : 11
% 0.20/0.54 # Initial clauses : 158
% 0.20/0.54 # Removed in clause preprocessing : 0
% 0.20/0.54 # Initial clauses in saturation : 158
% 0.20/0.54 # Processed clauses : 815
% 0.20/0.54 # ...of these trivial : 29
% 0.20/0.54 # ...subsumed : 309
% 0.20/0.54 # ...remaining for further processing : 477
% 0.20/0.54 # Other redundant clauses eliminated : 13
% 0.20/0.54 # Clauses deleted for lack of memory : 0
% 0.20/0.54 # Backward-subsumed : 22
% 0.20/0.54 # Backward-rewritten : 32
% 0.20/0.54 # Generated clauses : 1577
% 0.20/0.54 # ...of the previous two non-redundant : 1283
% 0.20/0.54 # ...aggressively subsumed : 0
% 0.20/0.54 # Contextual simplify-reflections : 1
% 0.20/0.54 # Paramodulations : 1560
% 0.20/0.54 # Factorizations : 2
% 0.20/0.54 # NegExts : 0
% 0.20/0.54 # Equation resolutions : 15
% 0.20/0.54 # Disequality decompositions : 0
% 0.20/0.54 # Total rewrite steps : 873
% 0.20/0.54 # ...of those cached : 713
% 0.20/0.54 # Propositional unsat checks : 0
% 0.20/0.54 # Propositional check models : 0
% 0.20/0.54 # Propositional check unsatisfiable : 0
% 0.20/0.54 # Propositional clauses : 0
% 0.20/0.54 # Propositional clauses after purity: 0
% 0.20/0.54 # Propositional unsat core size : 0
% 0.20/0.54 # Propositional preprocessing time : 0.000
% 0.20/0.54 # Propositional encoding time : 0.000
% 0.20/0.54 # Propositional solver time : 0.000
% 0.20/0.54 # Success case prop preproc time : 0.000
% 0.20/0.54 # Success case prop encoding time : 0.000
% 0.20/0.54 # Success case prop solver time : 0.000
% 0.20/0.54 # Current number of processed clauses : 270
% 0.20/0.54 # Positive orientable unit clauses : 58
% 0.20/0.54 # Positive unorientable unit clauses: 3
% 0.20/0.54 # Negative unit clauses : 35
% 0.20/0.54 # Non-unit-clauses : 174
% 0.20/0.54 # Current number of unprocessed clauses: 762
% 0.20/0.54 # ...number of literals in the above : 1735
% 0.20/0.54 # Current number of archived formulas : 0
% 0.20/0.54 # Current number of archived clauses : 204
% 0.20/0.54 # Clause-clause subsumption calls (NU) : 8143
% 0.20/0.54 # Rec. Clause-clause subsumption calls : 6912
% 0.20/0.54 # Non-unit clause-clause subsumptions : 155
% 0.20/0.54 # Unit Clause-clause subsumption calls : 3459
% 0.20/0.54 # Rewrite failures with RHS unbound : 0
% 0.20/0.54 # BW rewrite match attempts : 113
% 0.20/0.54 # BW rewrite match successes : 79
% 0.20/0.54 # Condensation attempts : 0
% 0.20/0.54 # Condensation successes : 0
% 0.20/0.54 # Termbank termtop insertions : 20801
% 0.20/0.54 # Search garbage collected termcells : 288
% 0.20/0.54
% 0.20/0.54 # -------------------------------------------------
% 0.20/0.54 # User time : 0.032 s
% 0.20/0.54 # System time : 0.007 s
% 0.20/0.54 # Total time : 0.039 s
% 0.20/0.54 # Maximum resident set size: 2068 pages
% 0.20/0.54
% 0.20/0.54 # -------------------------------------------------
% 0.20/0.54 # User time : 0.038 s
% 0.20/0.54 # System time : 0.007 s
% 0.20/0.54 # Total time : 0.045 s
% 0.20/0.54 # Maximum resident set size: 1820 pages
% 0.20/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------