TSTP Solution File: SET084-7 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET084-7 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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:22:02 EDT 2023
% Result : Unsatisfiable 0.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 15 ( 10 unt; 2 nHn; 11 RR)
% Number of literals : 22 ( 12 equ; 7 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 13 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_singleton_identified_by_element2_1,negated_conjecture,
singleton(x) = singleton(y),
file('/export/starexec/sandbox/tmp/tmp.G9QAO0XkVC/E---3.1_19410.p',prove_singleton_identified_by_element2_1) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/tmp/tmp.G9QAO0XkVC/E---3.1_19410.p',singleton_set) ).
cnf(unordered_pair_member,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.G9QAO0XkVC/E---3.1_19410.p',unordered_pair_member) ).
cnf(unordered_pair3,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/tmp/tmp.G9QAO0XkVC/E---3.1_19410.p',unordered_pair3) ).
cnf(prove_singleton_identified_by_element2_2,negated_conjecture,
member(y,universal_class),
file('/export/starexec/sandbox/tmp/tmp.G9QAO0XkVC/E---3.1_19410.p',prove_singleton_identified_by_element2_2) ).
cnf(prove_singleton_identified_by_element2_3,negated_conjecture,
x != y,
file('/export/starexec/sandbox/tmp/tmp.G9QAO0XkVC/E---3.1_19410.p',prove_singleton_identified_by_element2_3) ).
cnf(c_0_6,negated_conjecture,
singleton(x) = singleton(y),
prove_singleton_identified_by_element2_1 ).
cnf(c_0_7,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_8,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
unordered_pair_member ).
cnf(c_0_9,negated_conjecture,
unordered_pair(x,x) = unordered_pair(y,y),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_7]) ).
cnf(c_0_10,negated_conjecture,
( X1 = x
| ~ member(X1,unordered_pair(y,y)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
unordered_pair3 ).
cnf(c_0_12,negated_conjecture,
member(y,universal_class),
prove_singleton_identified_by_element2_2 ).
cnf(c_0_13,negated_conjecture,
x != y,
prove_singleton_identified_by_element2_3 ).
cnf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SET084-7 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n031.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 2400
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon Oct 2 17:31:43 EDT 2023
% 0.09/0.29 % CPUTime :
% 0.14/0.39 Running first-order model finding
% 0.14/0.39 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.G9QAO0XkVC/E---3.1_19410.p
% 0.14/0.41 # Version: 3.1pre001
% 0.14/0.41 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 # Starting sh5l with 300s (1) cores
% 0.14/0.41 # new_bool_3 with pid 19489 completed with status 0
% 0.14/0.41 # Result found by new_bool_3
% 0.14/0.41 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.41 # Search class: FGHSM-FFMS21-MFFFFFNN
% 0.14/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.14/0.41 # SAT001_MinMin_p005000_rr_RG with pid 19492 completed with status 0
% 0.14/0.41 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.14/0.41 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.41 # Search class: FGHSM-FFMS21-MFFFFFNN
% 0.14/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.14/0.41 # Preprocessing time : 0.001 s
% 0.14/0.41 # Presaturation interreduction done
% 0.14/0.41
% 0.14/0.41 # Proof found!
% 0.14/0.41 # SZS status Unsatisfiable
% 0.14/0.41 # SZS output start CNFRefutation
% See solution above
% 0.14/0.41 # Parsed axioms : 129
% 0.14/0.41 # Removed by relevancy pruning/SinE : 83
% 0.14/0.41 # Initial clauses : 46
% 0.14/0.41 # Removed in clause preprocessing : 0
% 0.14/0.41 # Initial clauses in saturation : 46
% 0.14/0.41 # Processed clauses : 99
% 0.14/0.41 # ...of these trivial : 0
% 0.14/0.41 # ...subsumed : 8
% 0.14/0.41 # ...remaining for further processing : 91
% 0.14/0.41 # Other redundant clauses eliminated : 2
% 0.14/0.41 # Clauses deleted for lack of memory : 0
% 0.14/0.41 # Backward-subsumed : 0
% 0.14/0.41 # Backward-rewritten : 4
% 0.14/0.41 # Generated clauses : 85
% 0.14/0.41 # ...of the previous two non-redundant : 52
% 0.14/0.41 # ...aggressively subsumed : 0
% 0.14/0.41 # Contextual simplify-reflections : 0
% 0.14/0.41 # Paramodulations : 83
% 0.14/0.41 # Factorizations : 0
% 0.14/0.41 # NegExts : 0
% 0.14/0.41 # Equation resolutions : 2
% 0.14/0.41 # Total rewrite steps : 40
% 0.14/0.41 # Propositional unsat checks : 0
% 0.14/0.41 # Propositional check models : 0
% 0.14/0.41 # Propositional check unsatisfiable : 0
% 0.14/0.41 # Propositional clauses : 0
% 0.14/0.41 # Propositional clauses after purity: 0
% 0.14/0.41 # Propositional unsat core size : 0
% 0.14/0.41 # Propositional preprocessing time : 0.000
% 0.14/0.41 # Propositional encoding time : 0.000
% 0.14/0.41 # Propositional solver time : 0.000
% 0.14/0.41 # Success case prop preproc time : 0.000
% 0.14/0.41 # Success case prop encoding time : 0.000
% 0.14/0.41 # Success case prop solver time : 0.000
% 0.14/0.41 # Current number of processed clauses : 41
% 0.14/0.41 # Positive orientable unit clauses : 16
% 0.14/0.41 # Positive unorientable unit clauses: 1
% 0.14/0.41 # Negative unit clauses : 4
% 0.14/0.41 # Non-unit-clauses : 20
% 0.14/0.41 # Current number of unprocessed clauses: 42
% 0.14/0.41 # ...number of literals in the above : 80
% 0.14/0.41 # Current number of archived formulas : 0
% 0.14/0.41 # Current number of archived clauses : 48
% 0.14/0.41 # Clause-clause subsumption calls (NU) : 102
% 0.14/0.41 # Rec. Clause-clause subsumption calls : 102
% 0.14/0.41 # Non-unit clause-clause subsumptions : 7
% 0.14/0.41 # Unit Clause-clause subsumption calls : 9
% 0.14/0.41 # Rewrite failures with RHS unbound : 0
% 0.14/0.41 # BW rewrite match attempts : 30
% 0.14/0.41 # BW rewrite match successes : 24
% 0.14/0.41 # Condensation attempts : 0
% 0.14/0.41 # Condensation successes : 0
% 0.14/0.41 # Termbank termtop insertions : 2362
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.005 s
% 0.14/0.41 # System time : 0.002 s
% 0.14/0.41 # Total time : 0.007 s
% 0.14/0.41 # Maximum resident set size: 1840 pages
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.009 s
% 0.14/0.41 # System time : 0.003 s
% 0.14/0.41 # Total time : 0.012 s
% 0.14/0.41 # Maximum resident set size: 1776 pages
% 0.14/0.41 % E---3.1 exiting
%------------------------------------------------------------------------------