TSTP Solution File: SET121-7 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET121-7 : TPTP v8.1.2. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:18:08 EDT 2024
% Result : Unsatisfiable 0.65s 0.56s
% Output : CNFRefutation 0.65s
% 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/sandbox/tmp/tmp.7Ur0APesAv/E---3.1_5439.p',cartesian_product2) ).
cnf(existence_of_1st_and_2nd_2,axiom,
( member(ordered_pair(first(X1),second(X1)),cross_product(universal_class,universal_class))
| first(X1) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.7Ur0APesAv/E---3.1_5439.p',existence_of_1st_and_2nd_2) ).
cnf(existence_of_1st_and_2nd_4,axiom,
( ordered_pair(first(X1),second(X1)) = X1
| first(X1) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.7Ur0APesAv/E---3.1_5439.p',existence_of_1st_and_2nd_4) ).
cnf(prove_corollary_1_to_OP_determines_components2_1,negated_conjecture,
~ member(y,universal_class),
file('/export/starexec/sandbox/tmp/tmp.7Ur0APesAv/E---3.1_5439.p',prove_corollary_1_to_OP_determines_components2_1) ).
cnf(prove_corollary_1_to_OP_determines_components2_2,negated_conjecture,
first(ordered_pair(x,y)) != ordered_pair(x,y),
file('/export/starexec/sandbox/tmp/tmp.7Ur0APesAv/E---3.1_5439.p',prove_corollary_1_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))
| first(X1) = X1 ),
existence_of_1st_and_2nd_2 ).
cnf(c_0_7,axiom,
( ordered_pair(first(X1),second(X1)) = X1
| first(X1) = X1 ),
existence_of_1st_and_2nd_4 ).
cnf(c_0_8,negated_conjecture,
~ member(y,universal_class),
inference(fof_simplification,[status(thm)],[prove_corollary_1_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,
( first(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,
first(ordered_pair(x,y)) != ordered_pair(x,y),
inference(fof_simplification,[status(thm)],[prove_corollary_1_to_OP_determines_components2_2]) ).
cnf(c_0_12,negated_conjecture,
~ member(y,universal_class),
c_0_8 ).
cnf(c_0_13,plain,
( first(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,
first(ordered_pair(x,y)) != ordered_pair(x,y),
c_0_11 ).
cnf(c_0_15,negated_conjecture,
first(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.06/0.12 % Problem : SET121-7 : TPTP v8.1.2. Bugfixed v7.3.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n015.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:47:51 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.48 Running first-order theorem proving
% 0.19/0.48 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.7Ur0APesAv/E---3.1_5439.p
% 0.65/0.56 # Version: 3.1.0
% 0.65/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.65/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.65/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.65/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.65/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.65/0.56 # Starting sh5l with 300s (1) cores
% 0.65/0.56 # sh5l with pid 5567 completed with status 0
% 0.65/0.56 # Result found by sh5l
% 0.65/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.65/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.65/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.65/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.65/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.65/0.56 # Starting sh5l with 300s (1) cores
% 0.65/0.56 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.65/0.56 # Search class: FGHSM-FFLM31-MFFFFFNN
% 0.65/0.56 # Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.65/0.56 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 109s (1) cores
% 0.65/0.56 # 208_C09_12_F1_SE_CS_SP_PS_S070I with pid 5572 completed with status 0
% 0.65/0.56 # Result found by 208_C09_12_F1_SE_CS_SP_PS_S070I
% 0.65/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.65/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.65/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.65/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.65/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.65/0.56 # Starting sh5l with 300s (1) cores
% 0.65/0.56 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.65/0.56 # Search class: FGHSM-FFLM31-MFFFFFNN
% 0.65/0.56 # Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.65/0.56 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 109s (1) cores
% 0.65/0.56 # Preprocessing time : 0.003 s
% 0.65/0.56 # Presaturation interreduction done
% 0.65/0.56
% 0.65/0.56 # Proof found!
% 0.65/0.56 # SZS status Unsatisfiable
% 0.65/0.56 # SZS output start CNFRefutation
% See solution above
% 0.65/0.56 # Parsed axioms : 169
% 0.65/0.56 # Removed by relevancy pruning/SinE : 11
% 0.65/0.56 # Initial clauses : 158
% 0.65/0.56 # Removed in clause preprocessing : 0
% 0.65/0.56 # Initial clauses in saturation : 158
% 0.65/0.56 # Processed clauses : 830
% 0.65/0.56 # ...of these trivial : 33
% 0.65/0.56 # ...subsumed : 315
% 0.65/0.56 # ...remaining for further processing : 482
% 0.65/0.56 # Other redundant clauses eliminated : 18
% 0.65/0.56 # Clauses deleted for lack of memory : 0
% 0.65/0.56 # Backward-subsumed : 24
% 0.65/0.56 # Backward-rewritten : 32
% 0.65/0.56 # Generated clauses : 1664
% 0.65/0.56 # ...of the previous two non-redundant : 1347
% 0.65/0.56 # ...aggressively subsumed : 0
% 0.65/0.56 # Contextual simplify-reflections : 1
% 0.65/0.56 # Paramodulations : 1642
% 0.65/0.56 # Factorizations : 2
% 0.65/0.56 # NegExts : 0
% 0.65/0.56 # Equation resolutions : 20
% 0.65/0.56 # Disequality decompositions : 0
% 0.65/0.56 # Total rewrite steps : 912
% 0.65/0.56 # ...of those cached : 743
% 0.65/0.56 # Propositional unsat checks : 0
% 0.65/0.56 # Propositional check models : 0
% 0.65/0.56 # Propositional check unsatisfiable : 0
% 0.65/0.56 # Propositional clauses : 0
% 0.65/0.56 # Propositional clauses after purity: 0
% 0.65/0.56 # Propositional unsat core size : 0
% 0.65/0.56 # Propositional preprocessing time : 0.000
% 0.65/0.56 # Propositional encoding time : 0.000
% 0.65/0.56 # Propositional solver time : 0.000
% 0.65/0.56 # Success case prop preproc time : 0.000
% 0.65/0.56 # Success case prop encoding time : 0.000
% 0.65/0.56 # Success case prop solver time : 0.000
% 0.65/0.56 # Current number of processed clauses : 273
% 0.65/0.56 # Positive orientable unit clauses : 60
% 0.65/0.56 # Positive unorientable unit clauses: 3
% 0.65/0.56 # Negative unit clauses : 37
% 0.65/0.56 # Non-unit-clauses : 173
% 0.65/0.56 # Current number of unprocessed clauses: 802
% 0.65/0.56 # ...number of literals in the above : 1825
% 0.65/0.56 # Current number of archived formulas : 0
% 0.65/0.56 # Current number of archived clauses : 206
% 0.65/0.56 # Clause-clause subsumption calls (NU) : 8050
% 0.65/0.56 # Rec. Clause-clause subsumption calls : 6830
% 0.65/0.56 # Non-unit clause-clause subsumptions : 156
% 0.65/0.56 # Unit Clause-clause subsumption calls : 3778
% 0.65/0.56 # Rewrite failures with RHS unbound : 0
% 0.65/0.56 # BW rewrite match attempts : 112
% 0.65/0.56 # BW rewrite match successes : 80
% 0.65/0.56 # Condensation attempts : 0
% 0.65/0.56 # Condensation successes : 0
% 0.65/0.56 # Termbank termtop insertions : 21516
% 0.65/0.56 # Search garbage collected termcells : 288
% 0.65/0.56
% 0.65/0.56 # -------------------------------------------------
% 0.65/0.56 # User time : 0.052 s
% 0.65/0.56 # System time : 0.008 s
% 0.65/0.56 # Total time : 0.060 s
% 0.65/0.56 # Maximum resident set size: 2068 pages
% 0.65/0.56
% 0.65/0.56 # -------------------------------------------------
% 0.65/0.56 # User time : 0.057 s
% 0.65/0.56 # System time : 0.010 s
% 0.65/0.56 # Total time : 0.067 s
% 0.65/0.56 # Maximum resident set size: 1820 pages
% 0.65/0.56 % E---3.1 exiting
% 0.65/0.56 % E exiting
%------------------------------------------------------------------------------