TSTP Solution File: SET020-7 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET020-7 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 : Tue May 21 02:52:31 EDT 2024
% Result : Unsatisfiable 0.21s 0.54s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of clauses : 19 ( 8 unt; 0 nHn; 19 RR)
% Number of literals : 33 ( 15 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 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 : 37 ( 24 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cartesian_product4,axiom,
( ordered_pair(first(X1),second(X1)) = X1
| ~ member(X1,cross_product(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',cartesian_product4) ).
cnf(corollary_1_to_cartesian_product,axiom,
( member(X1,universal_class)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',corollary_1_to_cartesian_product) ).
cnf(prove_unique_1st_and_2nd_in_pair_of_sets1_1,negated_conjecture,
member(ordered_pair(u,v),cross_product(universal_class,universal_class)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_unique_1st_and_2nd_in_pair_of_sets1_1) ).
cnf(ordered_pair_determines_components1,axiom,
( X1 = X3
| ordered_pair(X1,X2) != ordered_pair(X3,X4)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ordered_pair_determines_components1) ).
cnf(prove_unique_1st_and_2nd_in_pair_of_sets1_2,negated_conjecture,
first(ordered_pair(u,v)) != u,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_unique_1st_and_2nd_in_pair_of_sets1_2) ).
cnf(c_0_5,plain,
( ordered_pair(first(X1),second(X1)) = X1
| ~ member(X1,cross_product(X2,X3)) ),
inference(fof_simplification,[status(thm)],[cartesian_product4]) ).
cnf(c_0_6,plain,
( member(X1,universal_class)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
inference(fof_simplification,[status(thm)],[corollary_1_to_cartesian_product]) ).
cnf(c_0_7,plain,
( ordered_pair(first(X1),second(X1)) = X1
| ~ member(X1,cross_product(X2,X3)) ),
c_0_5 ).
cnf(c_0_8,negated_conjecture,
member(ordered_pair(u,v),cross_product(universal_class,universal_class)),
prove_unique_1st_and_2nd_in_pair_of_sets1_1 ).
cnf(c_0_9,plain,
( member(X1,universal_class)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
c_0_6 ).
cnf(c_0_10,negated_conjecture,
ordered_pair(first(ordered_pair(u,v)),second(ordered_pair(u,v))) = ordered_pair(u,v),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
( X1 = X3
| ordered_pair(X1,X2) != ordered_pair(X3,X4)
| ~ member(X1,universal_class) ),
inference(fof_simplification,[status(thm)],[ordered_pair_determines_components1]) ).
cnf(c_0_12,negated_conjecture,
( member(first(ordered_pair(u,v)),universal_class)
| ~ member(ordered_pair(u,v),cross_product(X1,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( X1 = X3
| ordered_pair(X1,X2) != ordered_pair(X3,X4)
| ~ member(X1,universal_class) ),
c_0_11 ).
cnf(c_0_14,negated_conjecture,
member(first(ordered_pair(u,v)),universal_class),
inference(spm,[status(thm)],[c_0_12,c_0_8]) ).
cnf(c_0_15,negated_conjecture,
first(ordered_pair(u,v)) != u,
inference(fof_simplification,[status(thm)],[prove_unique_1st_and_2nd_in_pair_of_sets1_2]) ).
cnf(c_0_16,negated_conjecture,
( first(ordered_pair(u,v)) = X1
| ordered_pair(u,v) != ordered_pair(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_10]),c_0_14])]) ).
cnf(c_0_17,negated_conjecture,
first(ordered_pair(u,v)) != u,
c_0_15 ).
cnf(c_0_18,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_16]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET020-7 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n026.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon May 20 11:38:53 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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/benchmark/theBenchmark.p
% 0.21/0.53 # Version: 3.1.0
% 0.21/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # new_bool_1 with pid 6313 completed with status 0
% 0.21/0.53 # Result found by new_bool_1
% 0.21/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.53 # Search class: FGHSM-FFMS21-MFFFFFNN
% 0.21/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.53 # SAT001_MinMin_p005000_rr_RG with pid 6317 completed with status 0
% 0.21/0.53 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.54 # Search class: FGHSM-FFMS21-MFFFFFNN
% 0.21/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.54 # Preprocessing time : 0.002 s
% 0.21/0.54 # Presaturation interreduction done
% 0.21/0.54
% 0.21/0.54 # Proof found!
% 0.21/0.54 # SZS status Unsatisfiable
% 0.21/0.54 # SZS output start CNFRefutation
% See solution above
% 0.21/0.54 # Parsed axioms : 159
% 0.21/0.54 # Removed by relevancy pruning/SinE : 95
% 0.21/0.54 # Initial clauses : 64
% 0.21/0.54 # Removed in clause preprocessing : 0
% 0.21/0.54 # Initial clauses in saturation : 64
% 0.21/0.54 # Processed clauses : 247
% 0.21/0.54 # ...of these trivial : 2
% 0.21/0.54 # ...subsumed : 73
% 0.21/0.54 # ...remaining for further processing : 172
% 0.21/0.54 # Other redundant clauses eliminated : 12
% 0.21/0.54 # Clauses deleted for lack of memory : 0
% 0.21/0.54 # Backward-subsumed : 6
% 0.21/0.54 # Backward-rewritten : 2
% 0.21/0.54 # Generated clauses : 700
% 0.21/0.54 # ...of the previous two non-redundant : 525
% 0.21/0.54 # ...aggressively subsumed : 0
% 0.21/0.54 # Contextual simplify-reflections : 0
% 0.21/0.54 # Paramodulations : 684
% 0.21/0.54 # Factorizations : 0
% 0.21/0.54 # NegExts : 0
% 0.21/0.54 # Equation resolutions : 16
% 0.21/0.54 # Disequality decompositions : 0
% 0.21/0.54 # Total rewrite steps : 196
% 0.21/0.54 # ...of those cached : 154
% 0.21/0.54 # Propositional unsat checks : 0
% 0.21/0.54 # Propositional check models : 0
% 0.21/0.54 # Propositional check unsatisfiable : 0
% 0.21/0.54 # Propositional clauses : 0
% 0.21/0.54 # Propositional clauses after purity: 0
% 0.21/0.54 # Propositional unsat core size : 0
% 0.21/0.54 # Propositional preprocessing time : 0.000
% 0.21/0.54 # Propositional encoding time : 0.000
% 0.21/0.54 # Propositional solver time : 0.000
% 0.21/0.54 # Success case prop preproc time : 0.000
% 0.21/0.54 # Success case prop encoding time : 0.000
% 0.21/0.54 # Success case prop solver time : 0.000
% 0.21/0.54 # Current number of processed clauses : 101
% 0.21/0.54 # Positive orientable unit clauses : 24
% 0.21/0.54 # Positive unorientable unit clauses: 2
% 0.21/0.54 # Negative unit clauses : 6
% 0.21/0.54 # Non-unit-clauses : 69
% 0.21/0.54 # Current number of unprocessed clauses: 393
% 0.21/0.54 # ...number of literals in the above : 1105
% 0.21/0.54 # Current number of archived formulas : 0
% 0.21/0.54 # Current number of archived clauses : 69
% 0.21/0.54 # Clause-clause subsumption calls (NU) : 522
% 0.21/0.54 # Rec. Clause-clause subsumption calls : 458
% 0.21/0.54 # Non-unit clause-clause subsumptions : 60
% 0.21/0.54 # Unit Clause-clause subsumption calls : 23
% 0.21/0.54 # Rewrite failures with RHS unbound : 0
% 0.21/0.54 # BW rewrite match attempts : 31
% 0.21/0.54 # BW rewrite match successes : 23
% 0.21/0.54 # Condensation attempts : 0
% 0.21/0.54 # Condensation successes : 0
% 0.21/0.54 # Termbank termtop insertions : 9167
% 0.21/0.54 # Search garbage collected termcells : 517
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.022 s
% 0.21/0.54 # System time : 0.005 s
% 0.21/0.54 # Total time : 0.028 s
% 0.21/0.54 # Maximum resident set size: 1860 pages
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.027 s
% 0.21/0.54 # System time : 0.008 s
% 0.21/0.54 # Total time : 0.034 s
% 0.21/0.54 # Maximum resident set size: 1824 pages
% 0.21/0.54 % E---3.1 exiting
% 0.21/0.54 % E exiting
%------------------------------------------------------------------------------