TSTP Solution File: SET084-6 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET084-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:57:29 EDT 2024
% Result : Unsatisfiable 0.13s 0.40s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 18 ( 11 unt; 3 nHn; 13 RR)
% Number of literals : 28 ( 15 equ; 10 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 : 18 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(unordered_pair_member,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).
cnf(prove_singleton_identified_by_element2_1,negated_conjecture,
singleton(x) = singleton(y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_singleton_identified_by_element2_1) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(unordered_pair2,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair2) ).
cnf(prove_singleton_identified_by_element2_3,negated_conjecture,
x != y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_singleton_identified_by_element2_3) ).
cnf(prove_singleton_identified_by_element2_2,negated_conjecture,
member(y,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_singleton_identified_by_element2_2) ).
cnf(c_0_6,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
inference(fof_simplification,[status(thm)],[unordered_pair_member]) ).
cnf(c_0_7,negated_conjecture,
singleton(x) = singleton(y),
prove_singleton_identified_by_element2_1 ).
cnf(c_0_8,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_9,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
c_0_6 ).
cnf(c_0_10,negated_conjecture,
unordered_pair(y,y) = unordered_pair(x,x),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_8]) ).
cnf(c_0_11,plain,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
inference(fof_simplification,[status(thm)],[unordered_pair2]) ).
cnf(c_0_12,negated_conjecture,
x != y,
inference(fof_simplification,[status(thm)],[prove_singleton_identified_by_element2_3]) ).
cnf(c_0_13,negated_conjecture,
( X1 = x
| ~ member(X1,unordered_pair(y,y)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
c_0_11 ).
cnf(c_0_15,negated_conjecture,
member(y,universal_class),
prove_singleton_identified_by_element2_2 ).
cnf(c_0_16,negated_conjecture,
x != y,
c_0_12 ).
cnf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SET084-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.09/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n032.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 : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon May 20 12:35:07 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.13/0.38 Running first-order model finding
% 0.13/0.38 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/benchmark/theBenchmark.p
% 0.13/0.40 # Version: 3.1.0
% 0.13/0.40 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.40 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.40 # Starting sh5l with 300s (1) cores
% 0.13/0.40 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 27469 completed with status 0
% 0.13/0.40 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.13/0.40 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.40 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.40 # No SInE strategy applied
% 0.13/0.40 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.13/0.40 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.40 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.13/0.40 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.13/0.40 # Starting new_bool_1 with 308s (1) cores
% 0.13/0.40 # Starting sh5l with 304s (1) cores
% 0.13/0.40 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.13/0.40 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 27476 completed with status 0
% 0.13/0.40 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.40 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.40 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.40 # No SInE strategy applied
% 0.13/0.40 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.13/0.40 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.40 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.13/0.40 # Preprocessing time : 0.002 s
% 0.13/0.40 # Presaturation interreduction done
% 0.13/0.40
% 0.13/0.40 # Proof found!
% 0.13/0.40 # SZS status Unsatisfiable
% 0.13/0.40 # SZS output start CNFRefutation
% See solution above
% 0.13/0.40 # Parsed axioms : 94
% 0.13/0.40 # Removed by relevancy pruning/SinE : 0
% 0.13/0.40 # Initial clauses : 94
% 0.13/0.40 # Removed in clause preprocessing : 15
% 0.13/0.40 # Initial clauses in saturation : 79
% 0.13/0.40 # Processed clauses : 117
% 0.13/0.40 # ...of these trivial : 0
% 0.13/0.40 # ...subsumed : 1
% 0.13/0.40 # ...remaining for further processing : 116
% 0.13/0.40 # Other redundant clauses eliminated : 3
% 0.13/0.40 # Clauses deleted for lack of memory : 0
% 0.13/0.40 # Backward-subsumed : 1
% 0.13/0.40 # Backward-rewritten : 0
% 0.13/0.40 # Generated clauses : 17
% 0.13/0.40 # ...of the previous two non-redundant : 12
% 0.13/0.40 # ...aggressively subsumed : 0
% 0.13/0.40 # Contextual simplify-reflections : 0
% 0.13/0.40 # Paramodulations : 14
% 0.13/0.40 # Factorizations : 0
% 0.13/0.40 # NegExts : 0
% 0.13/0.40 # Equation resolutions : 3
% 0.13/0.40 # Disequality decompositions : 0
% 0.13/0.40 # Total rewrite steps : 4
% 0.13/0.40 # ...of those cached : 0
% 0.13/0.40 # Propositional unsat checks : 0
% 0.13/0.40 # Propositional check models : 0
% 0.13/0.40 # Propositional check unsatisfiable : 0
% 0.13/0.40 # Propositional clauses : 0
% 0.13/0.40 # Propositional clauses after purity: 0
% 0.13/0.40 # Propositional unsat core size : 0
% 0.13/0.40 # Propositional preprocessing time : 0.000
% 0.13/0.40 # Propositional encoding time : 0.000
% 0.13/0.40 # Propositional solver time : 0.000
% 0.13/0.40 # Success case prop preproc time : 0.000
% 0.13/0.40 # Success case prop encoding time : 0.000
% 0.13/0.40 # Success case prop solver time : 0.000
% 0.13/0.40 # Current number of processed clauses : 34
% 0.13/0.40 # Positive orientable unit clauses : 13
% 0.13/0.40 # Positive unorientable unit clauses: 0
% 0.13/0.40 # Negative unit clauses : 2
% 0.13/0.40 # Non-unit-clauses : 19
% 0.13/0.40 # Current number of unprocessed clauses: 51
% 0.13/0.40 # ...number of literals in the above : 124
% 0.13/0.40 # Current number of archived formulas : 0
% 0.13/0.40 # Current number of archived clauses : 94
% 0.13/0.40 # Clause-clause subsumption calls (NU) : 1099
% 0.13/0.40 # Rec. Clause-clause subsumption calls : 525
% 0.13/0.40 # Non-unit clause-clause subsumptions : 1
% 0.13/0.40 # Unit Clause-clause subsumption calls : 7
% 0.13/0.40 # Rewrite failures with RHS unbound : 0
% 0.13/0.40 # BW rewrite match attempts : 7
% 0.13/0.40 # BW rewrite match successes : 1
% 0.13/0.40 # Condensation attempts : 0
% 0.13/0.40 # Condensation successes : 0
% 0.13/0.40 # Termbank termtop insertions : 6027
% 0.13/0.40 # Search garbage collected termcells : 156
% 0.13/0.40
% 0.13/0.40 # -------------------------------------------------
% 0.13/0.40 # User time : 0.009 s
% 0.13/0.40 # System time : 0.002 s
% 0.13/0.40 # Total time : 0.011 s
% 0.13/0.40 # Maximum resident set size: 1928 pages
% 0.13/0.40
% 0.13/0.40 # -------------------------------------------------
% 0.13/0.40 # User time : 0.036 s
% 0.13/0.40 # System time : 0.007 s
% 0.13/0.40 # Total time : 0.043 s
% 0.13/0.40 # Maximum resident set size: 1776 pages
% 0.13/0.40 % E---3.1 exiting
%------------------------------------------------------------------------------