TSTP Solution File: SET020-7 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET020-7 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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:21:39 EDT 2023
% Result : Unsatisfiable 0.15s 0.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 15 ( 7 unt; 0 nHn; 15 RR)
% Number of literals : 25 ( 11 equ; 12 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 : 26 ( 17 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cartesian_product4,axiom,
( ordered_pair(first(X1),second(X1)) = X1
| ~ member(X1,cross_product(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.iwPYvg3ib9/E---3.1_17873.p',cartesian_product4) ).
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/tmp/tmp.iwPYvg3ib9/E---3.1_17873.p',prove_unique_1st_and_2nd_in_pair_of_sets1_1) ).
cnf(corollary_1_to_cartesian_product,axiom,
( member(X1,universal_class)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
file('/export/starexec/sandbox/tmp/tmp.iwPYvg3ib9/E---3.1_17873.p',corollary_1_to_cartesian_product) ).
cnf(ordered_pair_determines_components1,axiom,
( X1 = X3
| ordered_pair(X1,X2) != ordered_pair(X3,X4)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/tmp/tmp.iwPYvg3ib9/E---3.1_17873.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/tmp/tmp.iwPYvg3ib9/E---3.1_17873.p',prove_unique_1st_and_2nd_in_pair_of_sets1_2) ).
cnf(c_0_5,axiom,
( ordered_pair(first(X1),second(X1)) = X1
| ~ member(X1,cross_product(X2,X3)) ),
cartesian_product4 ).
cnf(c_0_6,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_7,axiom,
( member(X1,universal_class)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
corollary_1_to_cartesian_product ).
cnf(c_0_8,negated_conjecture,
ordered_pair(first(ordered_pair(u,v)),second(ordered_pair(u,v))) = ordered_pair(u,v),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,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_7,c_0_8]) ).
cnf(c_0_10,axiom,
( X1 = X3
| ordered_pair(X1,X2) != ordered_pair(X3,X4)
| ~ member(X1,universal_class) ),
ordered_pair_determines_components1 ).
cnf(c_0_11,negated_conjecture,
member(first(ordered_pair(u,v)),universal_class),
inference(spm,[status(thm)],[c_0_9,c_0_6]) ).
cnf(c_0_12,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_10,c_0_8]),c_0_11])]) ).
cnf(c_0_13,negated_conjecture,
first(ordered_pair(u,v)) != u,
prove_unique_1st_and_2nd_in_pair_of_sets1_2 ).
cnf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_12]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : SET020-7 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.08/0.11 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n001.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Oct 2 17:13:36 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 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.iwPYvg3ib9/E---3.1_17873.p
% 0.15/0.44 # Version: 3.1pre001
% 0.15/0.44 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 # Starting sh5l with 300s (1) cores
% 0.15/0.44 # new_bool_1 with pid 17963 completed with status 0
% 0.15/0.44 # Result found by new_bool_1
% 0.15/0.44 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.44 # Search class: FGHSM-FFMS21-MFFFFFNN
% 0.15/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.44 # SAT001_MinMin_p005000_rr_RG with pid 17965 completed with status 0
% 0.15/0.44 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.44 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.44 # Search class: FGHSM-FFMS21-MFFFFFNN
% 0.15/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.44 # Preprocessing time : 0.002 s
% 0.15/0.44 # Presaturation interreduction done
% 0.15/0.44
% 0.15/0.44 # Proof found!
% 0.15/0.44 # SZS status Unsatisfiable
% 0.15/0.44 # SZS output start CNFRefutation
% See solution above
% 0.15/0.44 # Parsed axioms : 159
% 0.15/0.44 # Removed by relevancy pruning/SinE : 95
% 0.15/0.44 # Initial clauses : 64
% 0.15/0.44 # Removed in clause preprocessing : 0
% 0.15/0.44 # Initial clauses in saturation : 64
% 0.15/0.44 # Processed clauses : 247
% 0.15/0.44 # ...of these trivial : 2
% 0.15/0.44 # ...subsumed : 73
% 0.15/0.44 # ...remaining for further processing : 172
% 0.15/0.44 # Other redundant clauses eliminated : 12
% 0.15/0.44 # Clauses deleted for lack of memory : 0
% 0.15/0.44 # Backward-subsumed : 6
% 0.15/0.44 # Backward-rewritten : 2
% 0.15/0.44 # Generated clauses : 700
% 0.15/0.44 # ...of the previous two non-redundant : 525
% 0.15/0.44 # ...aggressively subsumed : 0
% 0.15/0.44 # Contextual simplify-reflections : 0
% 0.15/0.44 # Paramodulations : 684
% 0.15/0.44 # Factorizations : 0
% 0.15/0.44 # NegExts : 0
% 0.15/0.44 # Equation resolutions : 16
% 0.15/0.44 # Total rewrite steps : 196
% 0.15/0.44 # Propositional unsat checks : 0
% 0.15/0.44 # Propositional check models : 0
% 0.15/0.44 # Propositional check unsatisfiable : 0
% 0.15/0.44 # Propositional clauses : 0
% 0.15/0.44 # Propositional clauses after purity: 0
% 0.15/0.44 # Propositional unsat core size : 0
% 0.15/0.44 # Propositional preprocessing time : 0.000
% 0.15/0.44 # Propositional encoding time : 0.000
% 0.15/0.44 # Propositional solver time : 0.000
% 0.15/0.44 # Success case prop preproc time : 0.000
% 0.15/0.44 # Success case prop encoding time : 0.000
% 0.15/0.44 # Success case prop solver time : 0.000
% 0.15/0.44 # Current number of processed clauses : 101
% 0.15/0.44 # Positive orientable unit clauses : 24
% 0.15/0.44 # Positive unorientable unit clauses: 2
% 0.15/0.44 # Negative unit clauses : 6
% 0.15/0.44 # Non-unit-clauses : 69
% 0.15/0.44 # Current number of unprocessed clauses: 393
% 0.15/0.44 # ...number of literals in the above : 1105
% 0.15/0.44 # Current number of archived formulas : 0
% 0.15/0.44 # Current number of archived clauses : 69
% 0.15/0.44 # Clause-clause subsumption calls (NU) : 522
% 0.15/0.44 # Rec. Clause-clause subsumption calls : 458
% 0.15/0.44 # Non-unit clause-clause subsumptions : 60
% 0.15/0.44 # Unit Clause-clause subsumption calls : 23
% 0.15/0.44 # Rewrite failures with RHS unbound : 0
% 0.15/0.44 # BW rewrite match attempts : 31
% 0.15/0.44 # BW rewrite match successes : 23
% 0.15/0.44 # Condensation attempts : 0
% 0.15/0.44 # Condensation successes : 0
% 0.15/0.44 # Termbank termtop insertions : 8914
% 0.15/0.44
% 0.15/0.44 # -------------------------------------------------
% 0.15/0.44 # User time : 0.014 s
% 0.15/0.44 # System time : 0.003 s
% 0.15/0.44 # Total time : 0.017 s
% 0.15/0.44 # Maximum resident set size: 1824 pages
% 0.15/0.44
% 0.15/0.44 # -------------------------------------------------
% 0.15/0.44 # User time : 0.018 s
% 0.15/0.44 # System time : 0.004 s
% 0.15/0.44 # Total time : 0.022 s
% 0.15/0.44 # Maximum resident set size: 1796 pages
% 0.15/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------