TSTP Solution File: SET074-7 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET074-7 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:58 EDT 2023
% Result : Unsatisfiable 0.22s 0.54s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 11 unt; 0 nHn; 8 RR)
% Number of literals : 15 ( 5 equ; 4 neg)
% Maximal clause size : 2 ( 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; 4 con; 0-2 aty)
% Number of variables : 11 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(unordered_pair2,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.uRRuaDsd2J/E---3.1_21711.p',unordered_pair2) ).
cnf(prove_corollary_to_unordered_pair_axiom2_1,negated_conjecture,
member(y,universal_class),
file('/export/starexec/sandbox2/tmp/tmp.uRRuaDsd2J/E---3.1_21711.p',prove_corollary_to_unordered_pair_axiom2_1) ).
cnf(prove_corollary_to_unordered_pair_axiom2_2,negated_conjecture,
unordered_pair(x,y) = null_class,
file('/export/starexec/sandbox2/tmp/tmp.uRRuaDsd2J/E---3.1_21711.p',prove_corollary_to_unordered_pair_axiom2_2) ).
cnf(commutativity_of_unordered_pair,axiom,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.uRRuaDsd2J/E---3.1_21711.p',commutativity_of_unordered_pair) ).
cnf(existence_of_null_class,axiom,
~ member(X1,null_class),
file('/export/starexec/sandbox2/tmp/tmp.uRRuaDsd2J/E---3.1_21711.p',existence_of_null_class) ).
cnf(c_0_5,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
unordered_pair2 ).
cnf(c_0_6,negated_conjecture,
member(y,universal_class),
prove_corollary_to_unordered_pair_axiom2_1 ).
cnf(c_0_7,negated_conjecture,
unordered_pair(x,y) = null_class,
prove_corollary_to_unordered_pair_axiom2_2 ).
cnf(c_0_8,axiom,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
commutativity_of_unordered_pair ).
cnf(c_0_9,negated_conjecture,
member(y,unordered_pair(y,X1)),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_10,negated_conjecture,
unordered_pair(y,x) = null_class,
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,axiom,
~ member(X1,null_class),
existence_of_null_class ).
cnf(c_0_12,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : SET074-7 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.12/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n021.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Oct 2 17:05:44 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.51 Running first-order model finding
% 0.22/0.51 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.uRRuaDsd2J/E---3.1_21711.p
% 0.22/0.54 # Version: 3.1pre001
% 0.22/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.54 # Starting sh5l with 300s (1) cores
% 0.22/0.54 # new_bool_3 with pid 21789 completed with status 0
% 0.22/0.54 # Result found by new_bool_3
% 0.22/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.54 # Search class: FGUSM-FFMS21-MFFFFFNN
% 0.22/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.54 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 181s (1) cores
% 0.22/0.54 # G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with pid 21792 completed with status 0
% 0.22/0.54 # Result found by G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S
% 0.22/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.54 # Search class: FGUSM-FFMS21-MFFFFFNN
% 0.22/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.54 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 181s (1) cores
% 0.22/0.54 # Preprocessing time : 0.004 s
% 0.22/0.54 # Presaturation interreduction done
% 0.22/0.54
% 0.22/0.54 # Proof found!
% 0.22/0.54 # SZS status Unsatisfiable
% 0.22/0.54 # SZS output start CNFRefutation
% See solution above
% 0.22/0.54 # Parsed axioms : 117
% 0.22/0.54 # Removed by relevancy pruning/SinE : 83
% 0.22/0.54 # Initial clauses : 34
% 0.22/0.54 # Removed in clause preprocessing : 0
% 0.22/0.54 # Initial clauses in saturation : 34
% 0.22/0.54 # Processed clauses : 70
% 0.22/0.54 # ...of these trivial : 0
% 0.22/0.54 # ...subsumed : 0
% 0.22/0.54 # ...remaining for further processing : 70
% 0.22/0.54 # Other redundant clauses eliminated : 2
% 0.22/0.54 # Clauses deleted for lack of memory : 0
% 0.22/0.54 # Backward-subsumed : 0
% 0.22/0.54 # Backward-rewritten : 1
% 0.22/0.54 # Generated clauses : 145
% 0.22/0.54 # ...of the previous two non-redundant : 121
% 0.22/0.54 # ...aggressively subsumed : 0
% 0.22/0.54 # Contextual simplify-reflections : 0
% 0.22/0.54 # Paramodulations : 141
% 0.22/0.54 # Factorizations : 0
% 0.22/0.54 # NegExts : 0
% 0.22/0.54 # Equation resolutions : 4
% 0.22/0.54 # Total rewrite steps : 21
% 0.22/0.54 # Propositional unsat checks : 0
% 0.22/0.54 # Propositional check models : 0
% 0.22/0.54 # Propositional check unsatisfiable : 0
% 0.22/0.54 # Propositional clauses : 0
% 0.22/0.54 # Propositional clauses after purity: 0
% 0.22/0.54 # Propositional unsat core size : 0
% 0.22/0.54 # Propositional preprocessing time : 0.000
% 0.22/0.54 # Propositional encoding time : 0.000
% 0.22/0.54 # Propositional solver time : 0.000
% 0.22/0.54 # Success case prop preproc time : 0.000
% 0.22/0.54 # Success case prop encoding time : 0.000
% 0.22/0.54 # Success case prop solver time : 0.000
% 0.22/0.54 # Current number of processed clauses : 35
% 0.22/0.54 # Positive orientable unit clauses : 13
% 0.22/0.54 # Positive unorientable unit clauses: 2
% 0.22/0.54 # Negative unit clauses : 1
% 0.22/0.54 # Non-unit-clauses : 19
% 0.22/0.54 # Current number of unprocessed clauses: 115
% 0.22/0.54 # ...number of literals in the above : 276
% 0.22/0.54 # Current number of archived formulas : 0
% 0.22/0.54 # Current number of archived clauses : 33
% 0.22/0.54 # Clause-clause subsumption calls (NU) : 50
% 0.22/0.54 # Rec. Clause-clause subsumption calls : 50
% 0.22/0.54 # Non-unit clause-clause subsumptions : 0
% 0.22/0.54 # Unit Clause-clause subsumption calls : 1
% 0.22/0.54 # Rewrite failures with RHS unbound : 0
% 0.22/0.54 # BW rewrite match attempts : 28
% 0.22/0.54 # BW rewrite match successes : 16
% 0.22/0.54 # Condensation attempts : 0
% 0.22/0.54 # Condensation successes : 0
% 0.22/0.54 # Termbank termtop insertions : 2615
% 0.22/0.54
% 0.22/0.54 # -------------------------------------------------
% 0.22/0.54 # User time : 0.007 s
% 0.22/0.54 # System time : 0.004 s
% 0.22/0.54 # Total time : 0.011 s
% 0.22/0.54 # Maximum resident set size: 1844 pages
% 0.22/0.54
% 0.22/0.54 # -------------------------------------------------
% 0.22/0.54 # User time : 0.009 s
% 0.22/0.54 # System time : 0.007 s
% 0.22/0.54 # Total time : 0.017 s
% 0.22/0.54 # Maximum resident set size: 1764 pages
% 0.22/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------