TSTP Solution File: SET025-4 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET025-4 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:01 EDT 2023
% Result : Unsatisfiable 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 11 unt; 0 nHn; 4 RR)
% Number of literals : 11 ( 5 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 12 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ordered_pair,axiom,
ordered_pair(X1,X2) = non_ordered_pair(singleton_set(X1),non_ordered_pair(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.7tyUcAj5l5/E---3.1_28051.p',ordered_pair) ).
cnf(singleton_set,axiom,
singleton_set(X1) = non_ordered_pair(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.7tyUcAj5l5/E---3.1_28051.p',singleton_set) ).
cnf(prove_ordered_pairs_are_small,negated_conjecture,
~ little_set(ordered_pair(a,b)),
file('/export/starexec/sandbox2/tmp/tmp.7tyUcAj5l5/E---3.1_28051.p',prove_ordered_pairs_are_small) ).
cnf(non_ordered_pair4,axiom,
little_set(non_ordered_pair(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.7tyUcAj5l5/E---3.1_28051.p',non_ordered_pair4) ).
cnf(c_0_4,axiom,
ordered_pair(X1,X2) = non_ordered_pair(singleton_set(X1),non_ordered_pair(X1,X2)),
ordered_pair ).
cnf(c_0_5,axiom,
singleton_set(X1) = non_ordered_pair(X1,X1),
singleton_set ).
cnf(c_0_6,negated_conjecture,
~ little_set(ordered_pair(a,b)),
prove_ordered_pairs_are_small ).
cnf(c_0_7,plain,
ordered_pair(X1,X2) = non_ordered_pair(non_ordered_pair(X1,X1),non_ordered_pair(X1,X2)),
inference(rw,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,negated_conjecture,
~ little_set(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,axiom,
little_set(non_ordered_pair(X1,X2)),
non_ordered_pair4 ).
cnf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET025-4 : TPTP v8.1.2. Released v1.0.0.
% 0.14/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n017.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Oct 2 17:02:11 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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.7tyUcAj5l5/E---3.1_28051.p
% 0.20/0.50 # Version: 3.1pre001
% 0.20/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 28209 completed with status 0
% 0.20/0.50 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.20/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: FGHSF-FFLS31-MFFFFFNN
% 0.20/0.50 # partial match(1): FGHSM-FFLS31-MFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 664s (1) cores
% 0.20/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/0.50 # Starting new_bool_3 with 216s (1) cores
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2i with 136s (1) cores
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S021I with 136s (1) cores
% 0.20/0.50 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 28220 completed with status 0
% 0.20/0.50 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.20/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: FGHSF-FFLS31-MFFFFFNN
% 0.20/0.50 # partial match(1): FGHSM-FFLS31-MFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 664s (1) cores
% 0.20/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/0.50 # Preprocessing time : 0.003 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Unsatisfiable
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 142
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 142
% 0.20/0.50 # Removed in clause preprocessing : 6
% 0.20/0.50 # Initial clauses in saturation : 136
% 0.20/0.50 # Processed clauses : 5
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 0
% 0.20/0.50 # ...remaining for further processing : 5
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 1
% 0.20/0.50 # Generated clauses : 0
% 0.20/0.50 # ...of the previous two non-redundant : 0
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 0
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Total rewrite steps : 1
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 4
% 0.20/0.50 # Positive orientable unit clauses : 3
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 1
% 0.20/0.50 # Non-unit-clauses : 0
% 0.20/0.50 # Current number of unprocessed clauses: 131
% 0.20/0.50 # ...number of literals in the above : 345
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 7
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.50 # Non-unit clause-clause subsumptions : 0
% 0.20/0.50 # Unit Clause-clause subsumption calls : 0
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 1
% 0.20/0.50 # BW rewrite match successes : 1
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 2573
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.005 s
% 0.20/0.50 # System time : 0.005 s
% 0.20/0.50 # Total time : 0.010 s
% 0.20/0.50 # Maximum resident set size: 2088 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.026 s
% 0.20/0.50 # System time : 0.009 s
% 0.20/0.50 # Total time : 0.035 s
% 0.20/0.50 # Maximum resident set size: 1804 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------