TSTP Solution File: SET023-3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET023-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:40 EDT 2023
% Result : Unsatisfiable 0.21s 0.57s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 22 ( 10 unt; 0 nHn; 17 RR)
% Number of literals : 37 ( 12 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ordered_pair,axiom,
ordered_pair(X1,X2) = non_ordered_pair(singleton_set(X1),non_ordered_pair(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.vXJUuLvHAE/E---3.1_9351.p',ordered_pair) ).
cnf(singleton_set,axiom,
singleton_set(X1) = non_ordered_pair(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.vXJUuLvHAE/E---3.1_9351.p',singleton_set) ).
cnf(property_of_second,axiom,
( second(ordered_pair(X1,X2)) = X2
| ~ little_set(X1)
| ~ little_set(X2) ),
file('/export/starexec/sandbox/tmp/tmp.vXJUuLvHAE/E---3.1_9351.p',property_of_second) ).
cnf(ordered_pair_predicate3,axiom,
( X1 = ordered_pair(f2(X1),f3(X1))
| ~ ordered_pair_predicate(X1) ),
file('/export/starexec/sandbox/tmp/tmp.vXJUuLvHAE/E---3.1_9351.p',ordered_pair_predicate3) ).
cnf(ordered_pair_predicate1,axiom,
( little_set(f2(X1))
| ~ ordered_pair_predicate(X1) ),
file('/export/starexec/sandbox/tmp/tmp.vXJUuLvHAE/E---3.1_9351.p',ordered_pair_predicate1) ).
cnf(ordered_pair_predicate2,axiom,
( little_set(f3(X1))
| ~ ordered_pair_predicate(X1) ),
file('/export/starexec/sandbox/tmp/tmp.vXJUuLvHAE/E---3.1_9351.p',ordered_pair_predicate2) ).
cnf(prove_second_component_is_small,negated_conjecture,
~ little_set(second(a)),
file('/export/starexec/sandbox/tmp/tmp.vXJUuLvHAE/E---3.1_9351.p',prove_second_component_is_small) ).
cnf(an_ordered_pair_predicate,hypothesis,
ordered_pair_predicate(a),
file('/export/starexec/sandbox/tmp/tmp.vXJUuLvHAE/E---3.1_9351.p',an_ordered_pair_predicate) ).
cnf(c_0_8,axiom,
ordered_pair(X1,X2) = non_ordered_pair(singleton_set(X1),non_ordered_pair(X1,X2)),
ordered_pair ).
cnf(c_0_9,axiom,
singleton_set(X1) = non_ordered_pair(X1,X1),
singleton_set ).
cnf(c_0_10,axiom,
( second(ordered_pair(X1,X2)) = X2
| ~ little_set(X1)
| ~ little_set(X2) ),
property_of_second ).
cnf(c_0_11,plain,
ordered_pair(X1,X2) = non_ordered_pair(non_ordered_pair(X1,X1),non_ordered_pair(X1,X2)),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,axiom,
( X1 = ordered_pair(f2(X1),f3(X1))
| ~ ordered_pair_predicate(X1) ),
ordered_pair_predicate3 ).
cnf(c_0_13,plain,
( second(non_ordered_pair(non_ordered_pair(X1,X1),non_ordered_pair(X1,X2))) = X2
| ~ little_set(X2)
| ~ little_set(X1) ),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( X1 = non_ordered_pair(non_ordered_pair(f2(X1),f2(X1)),non_ordered_pair(f2(X1),f3(X1)))
| ~ ordered_pair_predicate(X1) ),
inference(rw,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_15,axiom,
( little_set(f2(X1))
| ~ ordered_pair_predicate(X1) ),
ordered_pair_predicate1 ).
cnf(c_0_16,axiom,
( little_set(f3(X1))
| ~ ordered_pair_predicate(X1) ),
ordered_pair_predicate2 ).
cnf(c_0_17,plain,
( f3(X1) = second(X1)
| ~ ordered_pair_predicate(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16]) ).
cnf(c_0_18,negated_conjecture,
~ little_set(second(a)),
prove_second_component_is_small ).
cnf(c_0_19,plain,
( little_set(second(X1))
| ~ ordered_pair_predicate(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,hypothesis,
ordered_pair_predicate(a),
an_ordered_pair_predicate ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET023-3 : TPTP v8.1.2. Released v1.0.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n014.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon Oct 2 17:34:04 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.21/0.50 Running first-order model finding
% 0.21/0.50 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.vXJUuLvHAE/E---3.1_9351.p
% 0.21/0.57 # Version: 3.1pre001
% 0.21/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.57 # Starting sh5l with 300s (1) cores
% 0.21/0.57 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 9475 completed with status 0
% 0.21/0.57 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.21/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.57 # No SInE strategy applied
% 0.21/0.57 # Search class: FGHSF-FFLS31-MFFFFFNN
% 0.21/0.57 # partial match(1): FGHSM-FFLS31-MFFFFFNN
% 0.21/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.57 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 664s (1) cores
% 0.21/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.57 # Starting new_bool_3 with 216s (1) cores
% 0.21/0.57 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2i with 136s (1) cores
% 0.21/0.57 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S021I with 136s (1) cores
% 0.21/0.57 # G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 9483 completed with status 0
% 0.21/0.57 # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.21/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.57 # No SInE strategy applied
% 0.21/0.57 # Search class: FGHSF-FFLS31-MFFFFFNN
% 0.21/0.57 # partial match(1): FGHSM-FFLS31-MFFFFFNN
% 0.21/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.57 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 664s (1) cores
% 0.21/0.57 # Preprocessing time : 0.004 s
% 0.21/0.57
% 0.21/0.57 # Proof found!
% 0.21/0.57 # SZS status Unsatisfiable
% 0.21/0.57 # SZS output start CNFRefutation
% See solution above
% 0.21/0.57 # Parsed axioms : 150
% 0.21/0.57 # Removed by relevancy pruning/SinE : 0
% 0.21/0.57 # Initial clauses : 150
% 0.21/0.57 # Removed in clause preprocessing : 6
% 0.21/0.57 # Initial clauses in saturation : 144
% 0.21/0.57 # Processed clauses : 230
% 0.21/0.57 # ...of these trivial : 1
% 0.21/0.57 # ...subsumed : 11
% 0.21/0.57 # ...remaining for further processing : 218
% 0.21/0.57 # Other redundant clauses eliminated : 23
% 0.21/0.57 # Clauses deleted for lack of memory : 0
% 0.21/0.57 # Backward-subsumed : 0
% 0.21/0.57 # Backward-rewritten : 5
% 0.21/0.57 # Generated clauses : 1261
% 0.21/0.57 # ...of the previous two non-redundant : 1184
% 0.21/0.57 # ...aggressively subsumed : 0
% 0.21/0.57 # Contextual simplify-reflections : 3
% 0.21/0.57 # Paramodulations : 1221
% 0.21/0.57 # Factorizations : 10
% 0.21/0.57 # NegExts : 0
% 0.21/0.57 # Equation resolutions : 30
% 0.21/0.57 # Total rewrite steps : 256
% 0.21/0.57 # Propositional unsat checks : 0
% 0.21/0.57 # Propositional check models : 0
% 0.21/0.57 # Propositional check unsatisfiable : 0
% 0.21/0.57 # Propositional clauses : 0
% 0.21/0.57 # Propositional clauses after purity: 0
% 0.21/0.57 # Propositional unsat core size : 0
% 0.21/0.57 # Propositional preprocessing time : 0.000
% 0.21/0.57 # Propositional encoding time : 0.000
% 0.21/0.57 # Propositional solver time : 0.000
% 0.21/0.57 # Success case prop preproc time : 0.000
% 0.21/0.57 # Success case prop encoding time : 0.000
% 0.21/0.57 # Success case prop solver time : 0.000
% 0.21/0.57 # Current number of processed clauses : 210
% 0.21/0.57 # Positive orientable unit clauses : 28
% 0.21/0.57 # Positive unorientable unit clauses: 0
% 0.21/0.57 # Negative unit clauses : 6
% 0.21/0.57 # Non-unit-clauses : 176
% 0.21/0.57 # Current number of unprocessed clauses: 1063
% 0.21/0.57 # ...number of literals in the above : 3852
% 0.21/0.57 # Current number of archived formulas : 0
% 0.21/0.57 # Current number of archived clauses : 11
% 0.21/0.57 # Clause-clause subsumption calls (NU) : 4929
% 0.21/0.57 # Rec. Clause-clause subsumption calls : 2226
% 0.21/0.57 # Non-unit clause-clause subsumptions : 5
% 0.21/0.57 # Unit Clause-clause subsumption calls : 939
% 0.21/0.57 # Rewrite failures with RHS unbound : 0
% 0.21/0.57 # BW rewrite match attempts : 15
% 0.21/0.57 # BW rewrite match successes : 5
% 0.21/0.57 # Condensation attempts : 0
% 0.21/0.57 # Condensation successes : 0
% 0.21/0.57 # Termbank termtop insertions : 22930
% 0.21/0.57
% 0.21/0.57 # -------------------------------------------------
% 0.21/0.57 # User time : 0.052 s
% 0.21/0.57 # System time : 0.004 s
% 0.21/0.57 # Total time : 0.056 s
% 0.21/0.57 # Maximum resident set size: 2108 pages
% 0.21/0.57
% 0.21/0.57 # -------------------------------------------------
% 0.21/0.57 # User time : 0.245 s
% 0.21/0.57 # System time : 0.018 s
% 0.21/0.57 # Total time : 0.263 s
% 0.21/0.57 # Maximum resident set size: 1804 pages
% 0.21/0.57 % E---3.1 exiting
%------------------------------------------------------------------------------