TSTP Solution File: SET085-7 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET085-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:18:25 EDT 2023
% Result : Unsatisfiable 0.17s 0.45s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 17 ( 12 unt; 3 nHn; 13 RR)
% Number of literals : 25 ( 15 equ; 9 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 13 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_singleton_in_unordered_pair3_1,negated_conjecture,
unordered_pair(y,z) = singleton(x),
file('/export/starexec/sandbox2/tmp/tmp.mEUn5A8Myu/E---3.1_13807.p',prove_singleton_in_unordered_pair3_1) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/tmp/tmp.mEUn5A8Myu/E---3.1_13807.p',singleton_set) ).
cnf(unordered_pair_member,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.mEUn5A8Myu/E---3.1_13807.p',unordered_pair_member) ).
cnf(unordered_pair3,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.mEUn5A8Myu/E---3.1_13807.p',unordered_pair3) ).
cnf(prove_singleton_in_unordered_pair3_2,negated_conjecture,
member(x,universal_class),
file('/export/starexec/sandbox2/tmp/tmp.mEUn5A8Myu/E---3.1_13807.p',prove_singleton_in_unordered_pair3_2) ).
cnf(prove_singleton_in_unordered_pair3_3,negated_conjecture,
x != y,
file('/export/starexec/sandbox2/tmp/tmp.mEUn5A8Myu/E---3.1_13807.p',prove_singleton_in_unordered_pair3_3) ).
cnf(prove_singleton_in_unordered_pair3_4,negated_conjecture,
x != z,
file('/export/starexec/sandbox2/tmp/tmp.mEUn5A8Myu/E---3.1_13807.p',prove_singleton_in_unordered_pair3_4) ).
cnf(c_0_7,negated_conjecture,
unordered_pair(y,z) = singleton(x),
prove_singleton_in_unordered_pair3_1 ).
cnf(c_0_8,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_9,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
unordered_pair_member ).
cnf(c_0_10,negated_conjecture,
unordered_pair(y,z) = unordered_pair(x,x),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( X1 = y
| X1 = z
| ~ member(X1,unordered_pair(x,x)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
unordered_pair3 ).
cnf(c_0_13,negated_conjecture,
member(x,universal_class),
prove_singleton_in_unordered_pair3_2 ).
cnf(c_0_14,negated_conjecture,
x != y,
prove_singleton_in_unordered_pair3_3 ).
cnf(c_0_15,negated_conjecture,
x != z,
prove_singleton_in_unordered_pair3_4 ).
cnf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),c_0_14]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.12 % Problem : SET085-7 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n031.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Oct 2 17:23:43 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.mEUn5A8Myu/E---3.1_13807.p
% 0.17/0.45 # Version: 3.1pre001
% 0.17/0.45 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.45 # Starting sh5l with 300s (1) cores
% 0.17/0.45 # new_bool_3 with pid 13886 completed with status 0
% 0.17/0.45 # Result found by new_bool_3
% 0.17/0.45 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.45 # Search class: FGHSM-FFMS21-MFFFFFNN
% 0.17/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.45 # SAT001_MinMin_p005000_rr_RG with pid 13889 completed with status 0
% 0.17/0.45 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.45 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.45 # Search class: FGHSM-FFMS21-MFFFFFNN
% 0.17/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.45 # Preprocessing time : 0.001 s
% 0.17/0.45 # Presaturation interreduction done
% 0.17/0.45
% 0.17/0.45 # Proof found!
% 0.17/0.45 # SZS status Unsatisfiable
% 0.17/0.45 # SZS output start CNFRefutation
% See solution above
% 0.17/0.45 # Parsed axioms : 132
% 0.17/0.45 # Removed by relevancy pruning/SinE : 83
% 0.17/0.45 # Initial clauses : 49
% 0.17/0.45 # Removed in clause preprocessing : 0
% 0.17/0.45 # Initial clauses in saturation : 49
% 0.17/0.45 # Processed clauses : 125
% 0.17/0.45 # ...of these trivial : 0
% 0.17/0.45 # ...subsumed : 27
% 0.17/0.45 # ...remaining for further processing : 98
% 0.17/0.45 # Other redundant clauses eliminated : 2
% 0.17/0.45 # Clauses deleted for lack of memory : 0
% 0.17/0.45 # Backward-subsumed : 2
% 0.17/0.45 # Backward-rewritten : 2
% 0.17/0.45 # Generated clauses : 170
% 0.17/0.45 # ...of the previous two non-redundant : 126
% 0.17/0.45 # ...aggressively subsumed : 0
% 0.17/0.45 # Contextual simplify-reflections : 0
% 0.17/0.45 # Paramodulations : 167
% 0.17/0.45 # Factorizations : 0
% 0.17/0.45 # NegExts : 0
% 0.17/0.45 # Equation resolutions : 3
% 0.17/0.45 # Total rewrite steps : 48
% 0.17/0.45 # Propositional unsat checks : 0
% 0.17/0.45 # Propositional check models : 0
% 0.17/0.45 # Propositional check unsatisfiable : 0
% 0.17/0.45 # Propositional clauses : 0
% 0.17/0.45 # Propositional clauses after purity: 0
% 0.17/0.45 # Propositional unsat core size : 0
% 0.17/0.45 # Propositional preprocessing time : 0.000
% 0.17/0.45 # Propositional encoding time : 0.000
% 0.17/0.45 # Propositional solver time : 0.000
% 0.17/0.45 # Success case prop preproc time : 0.000
% 0.17/0.45 # Success case prop encoding time : 0.000
% 0.17/0.45 # Success case prop solver time : 0.000
% 0.17/0.45 # Current number of processed clauses : 46
% 0.17/0.45 # Positive orientable unit clauses : 16
% 0.17/0.45 # Positive unorientable unit clauses: 2
% 0.17/0.45 # Negative unit clauses : 5
% 0.17/0.45 # Non-unit-clauses : 23
% 0.17/0.45 # Current number of unprocessed clauses: 92
% 0.17/0.45 # ...number of literals in the above : 203
% 0.17/0.45 # Current number of archived formulas : 0
% 0.17/0.45 # Current number of archived clauses : 50
% 0.17/0.45 # Clause-clause subsumption calls (NU) : 132
% 0.17/0.45 # Rec. Clause-clause subsumption calls : 116
% 0.17/0.45 # Non-unit clause-clause subsumptions : 24
% 0.17/0.45 # Unit Clause-clause subsumption calls : 16
% 0.17/0.45 # Rewrite failures with RHS unbound : 0
% 0.17/0.45 # BW rewrite match attempts : 35
% 0.17/0.45 # BW rewrite match successes : 27
% 0.17/0.45 # Condensation attempts : 0
% 0.17/0.45 # Condensation successes : 0
% 0.17/0.45 # Termbank termtop insertions : 2940
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.006 s
% 0.17/0.45 # System time : 0.002 s
% 0.17/0.45 # Total time : 0.008 s
% 0.17/0.45 # Maximum resident set size: 1836 pages
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.007 s
% 0.17/0.45 # System time : 0.004 s
% 0.17/0.45 # Total time : 0.011 s
% 0.17/0.45 # Maximum resident set size: 1776 pages
% 0.17/0.45 % E---3.1 exiting
% 0.17/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------