TSTP Solution File: SET072-7 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET072-7 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:00 EDT 2024
% Result : Unsatisfiable 0.16s 0.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of clauses : 28 ( 15 unt; 3 nHn; 23 RR)
% Number of literals : 44 ( 14 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 42 ( 23 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(corollary_1_to_cartesian_product,axiom,
( member(X1,universal_class)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
file('/export/starexec/sandbox2/tmp/tmp.JdBXu4V5Ib/E---3.1_24781.p',corollary_1_to_cartesian_product) ).
cnf(unordered_pair2,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.JdBXu4V5Ib/E---3.1_24781.p',unordered_pair2) ).
cnf(prove_right_cancellation_2,negated_conjecture,
member(ordered_pair(x,y),cross_product(universal_class,universal_class)),
file('/export/starexec/sandbox2/tmp/tmp.JdBXu4V5Ib/E---3.1_24781.p',prove_right_cancellation_2) ).
cnf(unordered_pair_member,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.JdBXu4V5Ib/E---3.1_24781.p',unordered_pair_member) ).
cnf(prove_right_cancellation_1,negated_conjecture,
unordered_pair(x,z) = unordered_pair(y,z),
file('/export/starexec/sandbox2/tmp/tmp.JdBXu4V5Ib/E---3.1_24781.p',prove_right_cancellation_1) ).
cnf(prove_right_cancellation_3,negated_conjecture,
x != y,
file('/export/starexec/sandbox2/tmp/tmp.JdBXu4V5Ib/E---3.1_24781.p',prove_right_cancellation_3) ).
cnf(corollary_2_to_cartesian_product,axiom,
( member(X2,universal_class)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
file('/export/starexec/sandbox2/tmp/tmp.JdBXu4V5Ib/E---3.1_24781.p',corollary_2_to_cartesian_product) ).
cnf(c_0_7,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_8,plain,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
inference(fof_simplification,[status(thm)],[unordered_pair2]) ).
cnf(c_0_9,plain,
( member(X1,universal_class)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
c_0_7 ).
cnf(c_0_10,negated_conjecture,
member(ordered_pair(x,y),cross_product(universal_class,universal_class)),
prove_right_cancellation_2 ).
cnf(c_0_11,plain,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
c_0_8 ).
cnf(c_0_12,negated_conjecture,
member(x,universal_class),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
inference(fof_simplification,[status(thm)],[unordered_pair_member]) ).
cnf(c_0_14,negated_conjecture,
member(x,unordered_pair(x,X1)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
unordered_pair(x,z) = unordered_pair(y,z),
prove_right_cancellation_1 ).
cnf(c_0_16,negated_conjecture,
x != y,
inference(fof_simplification,[status(thm)],[prove_right_cancellation_3]) ).
cnf(c_0_17,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
c_0_13 ).
cnf(c_0_18,negated_conjecture,
member(x,unordered_pair(y,z)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
x != y,
c_0_16 ).
cnf(c_0_20,plain,
( member(X2,universal_class)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
inference(fof_simplification,[status(thm)],[corollary_2_to_cartesian_product]) ).
cnf(c_0_21,negated_conjecture,
z = x,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_22,plain,
( member(X2,universal_class)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
c_0_20 ).
cnf(c_0_23,negated_conjecture,
unordered_pair(x,x) = unordered_pair(y,x),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_21]),c_0_21]) ).
cnf(c_0_24,negated_conjecture,
member(y,universal_class),
inference(spm,[status(thm)],[c_0_22,c_0_10]) ).
cnf(c_0_25,negated_conjecture,
( X1 = x
| ~ member(X1,unordered_pair(y,x)) ),
inference(spm,[status(thm)],[c_0_17,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
member(y,unordered_pair(y,X1)),
inference(spm,[status(thm)],[c_0_11,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SET072-7 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n029.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Fri May 3 10:38:37 EDT 2024
% 0.16/0.31 % CPUTime :
% 0.16/0.43 Running first-order model finding
% 0.16/0.43 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.JdBXu4V5Ib/E---3.1_24781.p
% 0.16/0.45 # Version: 3.1.0
% 0.16/0.45 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 # Starting sh5l with 300s (1) cores
% 0.16/0.45 # new_bool_3 with pid 24863 completed with status 0
% 0.16/0.45 # Result found by new_bool_3
% 0.16/0.45 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45 # Search class: FGUSM-FFMS21-MFFFFFNN
% 0.16/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 181s (1) cores
% 0.16/0.45 # G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with pid 24866 completed with status 0
% 0.16/0.45 # Result found by G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S
% 0.16/0.45 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45 # Search class: FGUSM-FFMS21-MFFFFFNN
% 0.16/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 181s (1) cores
% 0.16/0.45 # Preprocessing time : 0.003 s
% 0.16/0.45 # Presaturation interreduction done
% 0.16/0.45
% 0.16/0.45 # Proof found!
% 0.16/0.45 # SZS status Unsatisfiable
% 0.16/0.45 # SZS output start CNFRefutation
% See solution above
% 0.16/0.45 # Parsed axioms : 117
% 0.16/0.45 # Removed by relevancy pruning/SinE : 83
% 0.16/0.45 # Initial clauses : 34
% 0.16/0.45 # Removed in clause preprocessing : 0
% 0.16/0.45 # Initial clauses in saturation : 34
% 0.16/0.45 # Processed clauses : 96
% 0.16/0.45 # ...of these trivial : 5
% 0.16/0.45 # ...subsumed : 4
% 0.16/0.45 # ...remaining for further processing : 87
% 0.16/0.45 # Other redundant clauses eliminated : 2
% 0.16/0.45 # Clauses deleted for lack of memory : 0
% 0.16/0.45 # Backward-subsumed : 0
% 0.16/0.45 # Backward-rewritten : 3
% 0.16/0.45 # Generated clauses : 231
% 0.16/0.45 # ...of the previous two non-redundant : 158
% 0.16/0.45 # ...aggressively subsumed : 0
% 0.16/0.45 # Contextual simplify-reflections : 0
% 0.16/0.45 # Paramodulations : 228
% 0.16/0.45 # Factorizations : 0
% 0.16/0.45 # NegExts : 0
% 0.16/0.45 # Equation resolutions : 3
% 0.16/0.45 # Disequality decompositions : 0
% 0.16/0.45 # Total rewrite steps : 84
% 0.16/0.45 # ...of those cached : 54
% 0.16/0.45 # Propositional unsat checks : 0
% 0.16/0.45 # Propositional check models : 0
% 0.16/0.45 # Propositional check unsatisfiable : 0
% 0.16/0.45 # Propositional clauses : 0
% 0.16/0.45 # Propositional clauses after purity: 0
% 0.16/0.45 # Propositional unsat core size : 0
% 0.16/0.45 # Propositional preprocessing time : 0.000
% 0.16/0.45 # Propositional encoding time : 0.000
% 0.16/0.45 # Propositional solver time : 0.000
% 0.16/0.45 # Success case prop preproc time : 0.000
% 0.16/0.45 # Success case prop encoding time : 0.000
% 0.16/0.45 # Success case prop solver time : 0.000
% 0.16/0.45 # Current number of processed clauses : 50
% 0.16/0.45 # Positive orientable unit clauses : 22
% 0.16/0.45 # Positive unorientable unit clauses: 2
% 0.16/0.45 # Negative unit clauses : 2
% 0.16/0.45 # Non-unit-clauses : 24
% 0.16/0.45 # Current number of unprocessed clauses: 128
% 0.16/0.45 # ...number of literals in the above : 278
% 0.16/0.45 # Current number of archived formulas : 0
% 0.16/0.45 # Current number of archived clauses : 35
% 0.16/0.45 # Clause-clause subsumption calls (NU) : 71
% 0.16/0.45 # Rec. Clause-clause subsumption calls : 71
% 0.16/0.45 # Non-unit clause-clause subsumptions : 3
% 0.16/0.45 # Unit Clause-clause subsumption calls : 27
% 0.16/0.45 # Rewrite failures with RHS unbound : 0
% 0.16/0.45 # BW rewrite match attempts : 40
% 0.16/0.45 # BW rewrite match successes : 26
% 0.16/0.45 # Condensation attempts : 0
% 0.16/0.45 # Condensation successes : 0
% 0.16/0.45 # Termbank termtop insertions : 3355
% 0.16/0.45 # Search garbage collected termcells : 431
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.007 s
% 0.16/0.45 # System time : 0.004 s
% 0.16/0.45 # Total time : 0.011 s
% 0.16/0.45 # Maximum resident set size: 1872 pages
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.010 s
% 0.16/0.45 # System time : 0.005 s
% 0.16/0.45 # Total time : 0.015 s
% 0.16/0.45 # Maximum resident set size: 1780 pages
% 0.16/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------