TSTP Solution File: SET038-3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET038-3 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:08 EDT 2024
% Result : Unsatisfiable 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of clauses : 56 ( 15 unt; 0 nHn; 53 RR)
% Number of literals : 127 ( 16 equ; 74 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 92 ( 18 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(apply_for_functions2,axiom,
( member(ordered_pair(X2,X3),X1)
| ~ function(X1)
| ~ member(X2,domain_of(X1))
| apply(X1,X2) != X3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',apply_for_functions2) ).
cnf(maps2,axiom,
( domain_of(X1) = X2
| ~ maps(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET003-0.ax',maps2) ).
cnf(maps1,axiom,
( function(X1)
| ~ maps(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET003-0.ax',maps1) ).
cnf(a_mapping,hypothesis,
maps(a_function,a_domain,a_range),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_mapping) ).
cnf(range_of4,axiom,
( member(X1,range_of(X2))
| ~ little_set(X1)
| ~ ordered_pair_predicate(X3)
| ~ member(X3,X2)
| X1 != second(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET003-0.ax',range_of4) ).
cnf(second_component_is_small,axiom,
( little_set(second(X1))
| ~ ordered_pair_predicate(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',second_component_is_small) ).
cnf(member_of_domain,hypothesis,
member(a,a_domain),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',member_of_domain) ).
cnf(ordered_pair_predicate4,axiom,
( ordered_pair_predicate(X1)
| ~ little_set(X2)
| ~ little_set(X3)
| X1 != ordered_pair(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET003-0.ax',ordered_pair_predicate4) ).
cnf(a2,axiom,
( little_set(X1)
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET003-0.ax',a2) ).
cnf(function_values_are_small,axiom,
( little_set(apply(X1,X2))
| ~ function(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',function_values_are_small) ).
cnf(maps3,axiom,
( subset(range_of(X1),X3)
| ~ maps(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET003-0.ax',maps3) ).
cnf(property_of_second,axiom,
( second(ordered_pair(X1,X2)) = X2
| ~ little_set(X1)
| ~ little_set(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',property_of_second) ).
cnf(subset1,axiom,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET003-0.ax',subset1) ).
cnf(prove_mapping_in_range,negated_conjecture,
~ member(apply(a_function,a),a_range),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_mapping_in_range) ).
cnf(c_0_14,plain,
( member(ordered_pair(X2,X3),X1)
| ~ function(X1)
| ~ member(X2,domain_of(X1))
| apply(X1,X2) != X3 ),
inference(fof_simplification,[status(thm)],[apply_for_functions2]) ).
cnf(c_0_15,plain,
( domain_of(X1) = X2
| ~ maps(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[maps2]) ).
cnf(c_0_16,plain,
( function(X1)
| ~ maps(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[maps1]) ).
cnf(c_0_17,plain,
( member(ordered_pair(X2,X3),X1)
| ~ function(X1)
| ~ member(X2,domain_of(X1))
| apply(X1,X2) != X3 ),
c_0_14 ).
cnf(c_0_18,plain,
( domain_of(X1) = X2
| ~ maps(X1,X2,X3) ),
c_0_15 ).
cnf(c_0_19,hypothesis,
maps(a_function,a_domain,a_range),
a_mapping ).
cnf(c_0_20,plain,
( function(X1)
| ~ maps(X1,X2,X3) ),
c_0_16 ).
cnf(c_0_21,plain,
( member(X1,range_of(X2))
| ~ little_set(X1)
| ~ ordered_pair_predicate(X3)
| ~ member(X3,X2)
| X1 != second(X3) ),
inference(fof_simplification,[status(thm)],[range_of4]) ).
cnf(c_0_22,plain,
( little_set(second(X1))
| ~ ordered_pair_predicate(X1) ),
inference(fof_simplification,[status(thm)],[second_component_is_small]) ).
cnf(c_0_23,plain,
( member(ordered_pair(X1,apply(X2,X1)),X2)
| ~ function(X2)
| ~ member(X1,domain_of(X2)) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_24,hypothesis,
domain_of(a_function) = a_domain,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,hypothesis,
function(a_function),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_26,plain,
( member(X1,range_of(X2))
| ~ little_set(X1)
| ~ ordered_pair_predicate(X3)
| ~ member(X3,X2)
| X1 != second(X3) ),
c_0_21 ).
cnf(c_0_27,plain,
( little_set(second(X1))
| ~ ordered_pair_predicate(X1) ),
c_0_22 ).
cnf(c_0_28,hypothesis,
( member(ordered_pair(X1,apply(a_function,X1)),a_function)
| ~ member(X1,a_domain) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_29,hypothesis,
member(a,a_domain),
member_of_domain ).
cnf(c_0_30,plain,
( ordered_pair_predicate(X1)
| ~ little_set(X2)
| ~ little_set(X3)
| X1 != ordered_pair(X2,X3) ),
inference(fof_simplification,[status(thm)],[ordered_pair_predicate4]) ).
cnf(c_0_31,plain,
( little_set(X1)
| ~ member(X1,X2) ),
inference(fof_simplification,[status(thm)],[a2]) ).
cnf(c_0_32,plain,
( member(second(X1),range_of(X2))
| ~ ordered_pair_predicate(X1)
| ~ member(X1,X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_26]),c_0_27]) ).
cnf(c_0_33,hypothesis,
member(ordered_pair(a,apply(a_function,a)),a_function),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,plain,
( ordered_pair_predicate(X1)
| ~ little_set(X2)
| ~ little_set(X3)
| X1 != ordered_pair(X2,X3) ),
c_0_30 ).
cnf(c_0_35,plain,
( little_set(X1)
| ~ member(X1,X2) ),
c_0_31 ).
cnf(c_0_36,hypothesis,
( member(second(ordered_pair(a,apply(a_function,a))),range_of(a_function))
| ~ ordered_pair_predicate(ordered_pair(a,apply(a_function,a))) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,plain,
( ordered_pair_predicate(ordered_pair(X1,X2))
| ~ little_set(X2)
| ~ little_set(X1) ),
inference(er,[status(thm)],[c_0_34]) ).
cnf(c_0_38,hypothesis,
little_set(a),
inference(spm,[status(thm)],[c_0_35,c_0_29]) ).
cnf(c_0_39,plain,
( little_set(apply(X1,X2))
| ~ function(X1) ),
inference(fof_simplification,[status(thm)],[function_values_are_small]) ).
cnf(c_0_40,plain,
( subset(range_of(X1),X3)
| ~ maps(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[maps3]) ).
cnf(c_0_41,hypothesis,
( member(second(ordered_pair(a,apply(a_function,a))),range_of(a_function))
| ~ little_set(apply(a_function,a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
cnf(c_0_42,plain,
( little_set(apply(X1,X2))
| ~ function(X1) ),
c_0_39 ).
cnf(c_0_43,plain,
( second(ordered_pair(X1,X2)) = X2
| ~ little_set(X1)
| ~ little_set(X2) ),
inference(fof_simplification,[status(thm)],[property_of_second]) ).
cnf(c_0_44,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(fof_simplification,[status(thm)],[subset1]) ).
cnf(c_0_45,plain,
( subset(range_of(X1),X3)
| ~ maps(X1,X2,X3) ),
c_0_40 ).
cnf(c_0_46,hypothesis,
member(second(ordered_pair(a,apply(a_function,a))),range_of(a_function)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_25])]) ).
cnf(c_0_47,plain,
( second(ordered_pair(X1,X2)) = X2
| ~ little_set(X1)
| ~ little_set(X2) ),
c_0_43 ).
cnf(c_0_48,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
c_0_44 ).
cnf(c_0_49,hypothesis,
subset(range_of(a_function),a_range),
inference(spm,[status(thm)],[c_0_45,c_0_19]) ).
cnf(c_0_50,hypothesis,
( member(apply(a_function,a),range_of(a_function))
| ~ little_set(apply(a_function,a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_38])]) ).
cnf(c_0_51,negated_conjecture,
~ member(apply(a_function,a),a_range),
inference(fof_simplification,[status(thm)],[prove_mapping_in_range]) ).
cnf(c_0_52,hypothesis,
( member(X1,a_range)
| ~ member(X1,range_of(a_function)) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,hypothesis,
member(apply(a_function,a),range_of(a_function)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_42]),c_0_25])]) ).
cnf(c_0_54,negated_conjecture,
~ member(apply(a_function,a),a_range),
c_0_51 ).
cnf(c_0_55,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET038-3 : TPTP v8.2.0. Released v1.0.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n016.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 11:18:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 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.20/0.49 # Version: 3.1.0
% 0.20/0.49 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # new_bool_3 with pid 27572 completed with status 0
% 0.20/0.49 # Result found by new_bool_3
% 0.20/0.49 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: FHUSS-FFMF21-SFFFFFNN
% 0.20/0.49 # partial match(1): FHUSM-FFMF21-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.20/0.49 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 27575 completed with status 0
% 0.20/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.20/0.49 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: FHUSS-FFMF21-SFFFFFNN
% 0.20/0.49 # partial match(1): FHUSM-FFMF21-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.20/0.49 # Preprocessing time : 0.002 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Unsatisfiable
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 166
% 0.20/0.49 # Removed by relevancy pruning/SinE : 133
% 0.20/0.49 # Initial clauses : 33
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 33
% 0.20/0.49 # Processed clauses : 106
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 106
% 0.20/0.49 # Other redundant clauses eliminated : 9
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 5
% 0.20/0.49 # Generated clauses : 82
% 0.20/0.49 # ...of the previous two non-redundant : 72
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 2
% 0.20/0.49 # Paramodulations : 71
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 11
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 24
% 0.20/0.49 # ...of those cached : 14
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 59
% 0.20/0.49 # Positive orientable unit clauses : 15
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 1
% 0.20/0.49 # Non-unit-clauses : 43
% 0.20/0.49 # Current number of unprocessed clauses: 26
% 0.20/0.49 # ...number of literals in the above : 59
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 38
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 234
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 126
% 0.20/0.49 # Non-unit clause-clause subsumptions : 2
% 0.20/0.49 # Unit Clause-clause subsumption calls : 6
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 4
% 0.20/0.49 # BW rewrite match successes : 3
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 3877
% 0.20/0.49 # Search garbage collected termcells : 711
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.011 s
% 0.20/0.49 # System time : 0.002 s
% 0.20/0.49 # Total time : 0.013 s
% 0.20/0.49 # Maximum resident set size: 2064 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.016 s
% 0.20/0.49 # System time : 0.002 s
% 0.20/0.49 # Total time : 0.019 s
% 0.20/0.49 # Maximum resident set size: 1844 pages
% 0.20/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------